Sciweavers

47 search results - page 9 / 10
» Game Theory and Adaptive Steganography
Sort
View
LAMAS
2005
Springer
13 years 11 months ago
An Overview of Cooperative and Competitive Multiagent Learning
Abstract Multi-agent systems (MASs) is an area of distributed artificial intelligence that emphasizes the joint behaviors of agents with some degree of autonomy and the complexiti...
Pieter Jan't Hoen, Karl Tuyls, Liviu Panait, Sean ...
ATAL
2008
Springer
13 years 8 months ago
Social reward shaping in the prisoner's dilemma
Reward shaping is a well-known technique applied to help reinforcement-learning agents converge more quickly to nearoptimal behavior. In this paper, we introduce social reward sha...
Monica Babes, Enrique Munoz de Cote, Michael L. Li...
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 6 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
AAAI
2010
13 years 5 months ago
A Trust Model for Supply Chain Management
hey generalize these factors to the abstract concepts of ability, integrity, and benevolence. This model does not use probabilistic decision theory. Other SCM trust factors have be...
Yasaman Haghpanah, Marie desJardins
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...