Sciweavers

107
Voted
COCO
2004
Springer
91views Algorithms» more  COCO 2004»
15 years 7 months ago
Compression of Samplable Sources
We study the compression of polynomially samplable sources. In particular, we give efficient prefix-free compression and decompression algorithms for three classes of such sources ...
Luca Trevisan, Salil P. Vadhan, David Zuckerman
ATAL
2006
Springer
15 years 7 months ago
A model of emotions for situated agents
Emotion is an essential element of human behavior. Particularly in stressful situations such as combat, it is at least as important as rational analysis in determining a participa...
H. Van Dyke Parunak, Robert Bisson, Sven Brueckner...
109
Voted
ATAL
2006
Springer
15 years 7 months ago
Modeling uncertain domains with polyagents
Agent-based modeling is a powerful tool for systems modeling. Instantiating each domain entity with an agent permits us to capture many aspects of system dynamics and interactions...
H. Van Dyke Parunak, Sven Brueckner
125
Voted
ATAL
2006
Springer
15 years 7 months ago
Security in multiagent systems by policy randomization
Security in multiagent systems is commonly defined as the ability of the system to deal with intentional threats from other agents. This paper focuses on domains where such intent...
Praveen Paruchuri, Milind Tambe, Fernando Ord&oacu...
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 7 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock