570 search results - page 24 / 114 » The Complexity of Reasoning with Global Constraints |
KR
2004
Springer
15 years 3 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
133
click to vote
Publication
Global logistics flows have increased dramatically in recent years due to the globalization in the world economy. It is more complex than the domestic logistics, consisting of mult...
TIME
1994
IEEE
15 years 1 months ago
1994
IEEE
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
Communication is the key feature of Multi-agent Systems. The interactions among components of a system may take many distinct forms of increasing complexity such as in auctions, n...