717 search results - page 121 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
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...
111
click to vote
PAMI
2012
13 years 6 days ago
2012
—The problem of automatic and optimal design of embedded object detector cascades is considered. Two main challenges are identified: optimization of the cascade configuration and...
RTA
1995
Springer
15 years 1 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
HEURISTICS
2010
14 years 7 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
CIAC
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...