Sciweavers

75 search results - page 10 / 15
» Search Procedures and Parallelism in Constraint Programming
Sort
View
AI
2011
Springer
13 years 2 months ago
Approximation of action theories and its application to conformant planning
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...
IPPS
2006
IEEE
14 years 1 months ago
An optimal approach to the task allocation problem on hierarchical architectures
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Alexander Metzner, Martin Fränzle, Christian ...
DSS
2007
113views more  DSS 2007»
13 years 7 months ago
An associate constraint network approach to extract multi-lingual information for crime analysis
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
Christopher C. Yang, Kar Wing Li
PPDP
2007
Springer
14 years 1 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
MOZ
2004
Springer
14 years 27 days ago
Compositional Abstractions for Search Factories
ional Abstractions for Search Factories Guido Tack, Didier Le Botlan MOZ 2004 Presented at International Mozart/Oz Conference (MOZ 2004) Charleroi, Belgium October 2004 Published i...
Guido Tack, Didier Le Botlan