2109 search results - page 55 / 422 » Solving Necklace Constraint Problems |
160
click to vote
FLAIRS
2004
15 years 5 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
158
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
107
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
We use viability techniques for solving Dirichlet problems with inequality constraints (obstacles) for a class of Hamilton-Jacobi equations. The hypograph of the “solution” is ...
127
click to vote
AAAI
1996
15 years 5 months ago
1996
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
158
click to vote
AIPS
2007
15 years 6 months ago
2007
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...