805 search results - page 52 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
137
click to vote
ENTCS
2008
15 years 4 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
149
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
This paper is aimed at calibrating the relative posture and position, i.e. extrinsic parameters, of a stationary camera against a 3D reference object which is not directly visible...
131
click to vote
TRANSCI
2010
14 years 11 months ago
2010
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
152
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
143
click to vote
AIPS
1994
15 years 5 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...