660 search results - page 65 / 132 » Hybrid CSP Solving |
146
Voted
COCOON
2010
Springer
15 years 7 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
132
Voted
AAAI
2007
15 years 6 months ago
2007
Consistencies are properties of Constraint Networks (CNs) that can be exploited in order to make inferences. When a significant amount of such inferences can be performed, CNs ar...
138
Voted
AIMSA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
162
click to vote
AUSAI
2008
Springer
15 years 5 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
127
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...