419 search results - page 55 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
CP
2007
Springer
14 years 2 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
STDBM
2004
Springer
14 years 1 months ago
2004
Springer
With the recent progress of spatial information technologies and mobile computing technologies, spatio-temporal databases which store information on moving objects including vehicl...
ICDE
2010
IEEE
13 years 8 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
AIPS
2008
13 years 10 months ago
2008
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...