Sciweavers

3514 search results - page 316 / 703
» Transportable Information Agents
Sort
View
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
16 years 1 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
ATAL
2004
Springer
16 years 29 days ago
Strategic Deception in Agents
CHRISTIAN, DAVID B. Strategic Deception in Agents. (Under the direction of Assistant Professor R. Michael Young). Despite its negative ethical connotations, deception is a useful ...
David B. Christian, R. Michael Young
AGENTS
1999
Springer
15 years 12 months ago
Exception Handling in Agent Systems
A critical challenge to creating effective agent-based systems is allowing them to operate effectively when the operating environment is complex, dynamic, and error-prone. In this...
Mark Klein, Chrysanthos Dellarocas
IAT
2008
IEEE
16 years 2 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 ...
IAT
2008
IEEE
16 years 2 months ago
Extending a Defeasible Reasoner with Modal and Deontic Logic Operators
Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information. Modal logic deals with necessity and possibility, exhibiting defeasibility; t...
Efstratios Kontopoulos, Nick Bassiliades, Guido Go...