550 search results - page 66 / 110 » Decision-Theoretic Simulated Annealing |
CHARME
2001
Springer
14 years 27 days ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
ASPDAC
2008
ACM
13 years 11 months ago
2008
ACM
Abstract-- In analog circuits, blocks need to be placed symmetrically to satisfy the devices matching. Different from the existing constraint-driven approaches, the proposed topolo...
ONDM
2001
13 years 10 months ago
2001
An efficient algorithm is presented to map an arbitrary traffic pattern and network topology on a mesh of rings network. The network is described by a two-layer model. The first la...
AAAI
1994
13 years 10 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
AE
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...