749 search results - page 113 / 150 » Dualities for Constraint Satisfaction Problems |
91
Voted
AI
2000
Springer
14 years 10 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
AIPS
2006
15 years 9 days ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
104
Voted
AISC
2008
Springer
15 years 28 days ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
91
Voted
FLAIRS
2004
15 years 9 days ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...
93
Voted
AIPS
2003
15 years 9 days ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...