Sciweavers

942 search results - page 61 / 189
» Cooperating Constraint Solvers
Sort
View
CP
2005
Springer
15 years 3 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus
AI
2010
Springer
14 years 10 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
JSAC
2007
132views more  JSAC 2007»
14 years 9 months ago
Lifetime maximization via cooperative nodes and relay deployment in wireless networks
— Extending lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributed nodes in wireless networks. Cooperative co...
Thanongsak Himsoon, W. Pam Siriwongpairat, Zhu Han...
MM
2000
ACM
114views Multimedia» more  MM 2000»
15 years 2 months ago
Virtual 3D camera composition from frame constraints
We have designed a graphical interface that enables 3D visual artists or developers of interactive 3D virtual environments to efficiently define sophisticated camera compositions ...
William H. Bares, Scott McDermott, Christina Boudr...
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
15 years 4 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...