4524 search results - page 200 / 905 » The Complexity of Global Constraints |
169
click to vote
GRAPHICSINTERFACE
1998
15 years 8 months ago
1998
In the past, new global illumination algorithms have usually been designed as a single module that was responsible for the simulation of all aspects of illumination in a scene. A ...
164
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
XML and semi-structured data are now de-facto standards for data exchange, and it is often the case that published or exchanged XML documents have specic restrictions on how they ...
164
click to vote
ISMVL
2009
IEEE
16 years 1 months ago
2009
IEEE
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
163
click to vote
CP
2004
Springer
16 years 23 hour ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
163
click to vote
SAT
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...