711 search results - page 66 / 143 » Amalgams of Constraint Satisfaction Problems |
117
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
123
click to vote
IDEAL
2003
Springer
15 years 9 months ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
125
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Many "semiring-like" structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing w...
115
Voted
CP
2001
Springer
15 years 9 months ago
2001
Springer
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
128
click to vote
CSCLP
2004
Springer
15 years 10 months ago
2004
Springer
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...