Sciweavers

18155 search results - page 3380 / 3631
» Point
Sort
View
139
Voted
ATAL
2006
Springer
15 years 7 months ago
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "coop...
Tsz-Chiu Au, Dana S. Nau
ATAL
2006
Springer
15 years 7 months ago
Learning to cooperate in multi-agent social dilemmas
In many Multi-Agent Systems (MAS), agents (even if selfinterested) need to cooperate in order to maximize their own utilities. Most of the multi-agent learning algorithms focus on...
Jose Enrique Munoz de Cote, Alessandro Lazaric, Ma...
CLUSTER
2004
IEEE
15 years 7 months ago
XChange: coupling parallel applications in a dynamic environment
Modern computational science applications are becoming increasingly multi-disciplinaty involving widely distributed research teams and their underlying computational platforms. A ...
Hasan Abbasi, Matthew Wolf, Karsten Schwan, Greg E...
ATAL
2006
Springer
15 years 7 months ago
Efficient agents for cliff-edge environments with a large set of decision options
This paper proposes an efficient agent for competing in Cliff Edge (CE) environments, such as sealed-bid auctions, dynamic pricing and the ultimatum game. The agent competes in on...
Ron Katz, Sarit Kraus
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
15 years 7 months ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
« Prev « First page 3380 / 3631 Last » Next »