808 search results - page 38 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
AAAI
2000
14 years 11 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
PODS
1999
ACM
15 years 2 months ago
1999
ACM
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...
ICDE
2010
IEEE
14 years 9 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...
CP
1997
Springer
15 years 1 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
IJCGA
2006
14 years 9 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...