Sciweavers

721 search results - page 43 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
AGENTS
2001
Springer
15 years 2 months ago
Argumentation as distributed constraint satisfaction: applications and results
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or ju...
Hyuckchul Jung, Milind Tambe, Shriniwas Kulkarni
KBSE
1997
IEEE
15 years 1 months ago
Exploiting Domain-Specific Knowledge to Refine Simulation Specifications
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...
David Pautler, Steven Woods, Alex Quilici
JCP
2008
117views more  JCP 2008»
14 years 9 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
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...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...
CSL
2006
Springer
15 years 1 months ago
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
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...
Manuel Bodirsky, Hubie Chen
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
14 years 9 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...