Sciweavers

2159 search results - page 279 / 432
» An Artificial Chemistry for Networking
Sort
View
ATAL
2007
Springer
15 years 10 months ago
Towards reflective mobile agents for resource-constrained mobile devices
The vision of ubiquitous computing is one in which resource constrained mobile devices form ad-hoc networks to enable the delivery of services that are sensitive and responsive to...
Conor Muldoon, Gregory M. P. O'Hare, John F. Bradl...
CP
2007
Springer
15 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ECAI
2006
Springer
15 years 10 months ago
Environment-Driven Skeletal Plan Execution for the Medical Domain
An important application of both data abstraction and plan execution is the execution of clinical guidelines and protocols (CGP), both to validate them against a large set of test ...
Peter Votruba, Andreas Seyfang, Michael Paesold, S...
BVAI
2007
Springer
15 years 8 months ago
Logic as Energy: A SAT-Based Approach
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...
Priscila Machado Vieira Lima, M. Mariela Morveli-E...
ECAI
2008
Springer
15 years 8 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...