Sciweavers

823 search results - page 69 / 165
» Stateful Subset Cover
Sort
View
DALT
2006
Springer
14 years 1 months ago
Producing Compliant Interactions: Conformance, Coverage, and Interoperability
Agents in an open system interact with each other based on (typically, published) protocols. An agent may, however, deviate from the protocol because of its internal policies. Such...
Amit K. Chopra, Munindar P. Singh
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 11 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
ATAL
2007
Springer
14 years 4 months ago
IFSA: incremental feature-set augmentation for reinforcement learning tasks
Reinforcement learning is a popular and successful framework for many agent-related problems because only limited environmental feedback is necessary for learning. While many algo...
Mazda Ahmadi, Matthew E. Taylor, Peter Stone
APN
2011
Springer
13 years 1 months ago
On the Origin of Events: Branching Cells as Stubborn Sets
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
Henri Hansen, Xu Wang
TEC
2008
127views more  TEC 2008»
13 years 10 months ago
Fingerprinting: Visualization and Automatic Analysis of Prisoner's Dilemma Strategies
Fingerprinting is a technique for generating a representation-independent functional signature for a game playing agent. Fingerprints can be used to compare agents across represent...
Daniel A. Ashlock, Eun-Youn Kim