942 search results - page 125 / 189 » Distance Constraint Satisfaction Problems |
136
Voted
CP
2001
Springer
15 years 8 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
121
Voted
ENDM
2000
15 years 3 months ago
2000
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
145
Voted
COLOGNETWENTE
2008
15 years 4 months ago
2008
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
124
Voted
ICMCS
1999
IEEE
15 years 7 months ago
1999
IEEE
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
128
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We investigate different evaluation strategies for planning problems represented as constraint satisfaction or satisfiability problems. The standard evaluation strategy, ...