714 search results - page 44 / 143 » Lexicographically-ordered constraint satisfaction problems |
100
click to vote
IJCAI
2001
15 years 2 months ago
2001
Parametric ordinary differential equations arise in many areas of science and engineering. Since some of the data is uncertain and given by intervals, traditional numerical method...
114
click to vote
AGENTS
2001
Springer
15 years 6 months ago
2001
Springer
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
118
click to vote
KBSE
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper discusses our approach to the problem of refining high-level simulation specifications. Our domain is simulated combat training for tank platoon members. Our input is a...
JCP
2008
15 years 1 months ago
2008
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
105
click to vote
CSL
2006
Springer
15 years 5 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...