Sciweavers

2266 search results - page 318 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
16 years 28 days ago
COSMO: a correlation sensitive mutation operator for multi-objective optimization
This contribution is the first to discover exploitable structural features within circuit optimization problems (COP) and discuss how it is indicative of a general structure and ...
Varun Aggarwal, Una-May O'Reilly
CEC
2003
IEEE
16 years 1 days ago
Comparative studies on micro heat exchanger optimisation
Although many methods for dealing with multi-objective optimisation (MOO) problems are available [Deb01] and successful applications have been reported [Coe01], the comparison betw...
Tatsuya Okabe, Kwasi Foli, Markus Olhofer, Yaochu ...
EVOW
2000
Springer
15 years 10 months ago
Prediction of Power Requirements for High-Speed Circuits
Modern VLSI design methodologies and manufacturing technologies are making circuits increasingly fast. The quest for higher circuit performance and integration density stems from f...
Fulvio Corno, Maurizio Rebaudengo, Matteo Sonza Re...
FOGA
2011
14 years 10 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
SAT
2005
Springer
145views Hardware» more  SAT 2005»
16 years 7 days ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman