1300 search results - page 102 / 260 » Constraint satisfaction problems and global cardinality cons... |
CP
2000
Springer
15 years 2 months ago
2000
Springer
We address the issue of detecting automatically occurrences of high level patterns in audiovisual documents. These patterns correspond to recurring sequences of shots, which are co...
AAAI
1994
14 years 11 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
105
click to vote
AUSAI
2008
Springer
15 years 2 days 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 ...
CPAIOR
2006
Springer
15 years 1 days ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
125
click to vote
CPAIOR
2010
Springer
14 years 8 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...