1278 search results - page 83 / 256 » The Complexity of Weighted Boolean |
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
CAD
2008
Springer
13 years 10 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
ENTCS
2006
13 years 10 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
ACSD
2010
IEEE
13 years 8 months ago
2010
IEEE
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...