1381 search results - page 113 / 277 » Computational Complexity of Constraint Satisfaction |
132
click to vote
AI
2006
Springer
15 years 4 months ago
2006
Springer
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
123
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
161
Voted
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
151
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
- Stable and effective enforcement of hard constraints is one of the crucial components in controlling physics-based dynamic simulation systems. The conventional explicit Baumgarte...
164
Voted
INFORMS
1998
15 years 4 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...