805 search results - page 38 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
FLAIRS
2003
13 years 10 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
ANOR
2007
13 years 8 months ago
2007
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
PPDP
2009
Springer
14 years 3 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
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...