592 search results - page 85 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
137
click to vote
CADE
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
134
click to vote
ISPD
2004
ACM
15 years 8 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
148
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
118
click to vote
JNW
2007
15 years 2 months ago
2007
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
119
click to vote
CLOUDCOM
2010
Springer
15 years 29 days ago
2010
Springer
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...