Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

The first polynomial-time algorithm to approximate (with arbitrary precision) the permanent of a non-negative matrix was presented by Jerrum, Sinclair and Vigoda. They designed a simulated annealing algorithm with a running time of O∗(n26) for 0/1 matrices. Subsequently, they improved their analysis, resulting in a O∗(n10) time algorithm. We present a O∗(n7) time algorithm. Our improvement come...

Thermo-electric Coolers nowadays are applied in a wide range of thermal energy systems. Over the past decades, many researches were employed to improve the efficiency of TECs by enhancing the material parameters and design parameters. The material parameters are the most significant, but they are restricted by currently available materials and module fabricating technologies. Therefore, the mai...

Software testing is an important stage in the software development process, which key to ensure quality and improve reliability. fault localization most part of testing. In this paper, problem modeled as a combinatorial optimization problem, using function call path starting point. A heuristic search algorithm based on hybrid genetic simulated annealing used locate defects. Experimental results...

A simulated annealing algorithm is used in the construction of subsquare free Latin squares. The algorithm is described and experience from its application is reported. Results obtained include the construction of subsquare free Latin squares of orders 16 and 18, the smallest orders for which existence of such squares was previously in doubt.