4524 search results - page 157 / 905 » The Complexity of Global Constraints |
97
Voted
AAAI
2000
15 years 2 months ago
2000
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
108
click to vote
ALIFE
2008
15 years 12 days ago
2008
Using biological examples and theoretical arguments, the case is presented for extending the notion of natural selection to include internal selection in order to account for the e...
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
84
Voted
DATE
2007
IEEE
15 years 7 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
106
click to vote
CAD
2000
Springer
15 years 19 days ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...