1289 search results - page 1 / 258 » Complexity of Counting the Optimal Solutions |
COCOON
2008
Springer
13 years 5 months ago
2008
Springer
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
We analyse the probability 1 − δ to be in an optimum solution after k steps of an inhomogeneous Markov chain which is specified by a logarithmic cooling schedule c(k) = Γ/ ln ...
ISPD
2012
ACM
12 years 11 days ago
2012
ACM
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
ISLPED
1995
ACM
13 years 8 months ago
1995
ACM
Thispaper proposes a method for achieving low-power control-logic modules using a combination of CMOS complex gate reorganization, transistor size optimization, and transistor lay...
CP
2009
Springer
14 years 5 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...