152 search results - page 15 / 31 » Solving hard instances of floorplacement |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
SAT
2004
Springer
14 years 21 days ago
2004
Springer
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantifie...
CPM
1998
Springer
13 years 11 months ago
1998
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
AAAI
2007
13 years 9 months ago
2007
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...