Sciweavers

237 search results - page 14 / 48
» Constraint Processing with Reactive Agents
Sort
View
IAT
2008
IEEE
14 years 3 months ago
Privacy Guarantees through Distributed Constraint Satisfaction
The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and co...
Boi Faltings, Thomas Léauté, Adrian ...
AAAI
2007
13 years 11 months ago
An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints
In the last decade, several approaches have been proposed for merging multiple and potentially conflicting pieces of information. Egalitarist fusion modes privilege solutions tha...
Salem Benferhat, Sylvain Lagrue, Julien Rossit
ATAL
2007
Springer
14 years 2 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 8 months ago
A Homogeneous Reaction Rule Language for Complex Event Processing
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
Adrian Paschke, Alexander Kozlenkov, Harold Boley
ATAL
2003
Springer
14 years 1 months ago
Process Algebra for Agent Communication: A General Semantic Approach
Abstract. In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent...
Rogier M. van Eijk, Frank S. de Boer, Wiebe van de...