559 search results - page 37 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
127
click to vote
FLAIRS
2007
15 years 5 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
121
Voted
SBACPAD
2003
IEEE
15 years 8 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
118
Voted
PPSN
1998
Springer
15 years 7 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
131
Voted
ECSQARU
2009
Springer
15 years 1 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
136
Voted
AI
2003
Springer
15 years 8 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...