Sciweavers

1101 search results - page 178 / 221
» Forcing in proof theory
Sort
View
FOCS
2008
IEEE
14 years 5 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
IROS
2008
IEEE
125views Robotics» more  IROS 2008»
14 years 5 months ago
Dynamic correlation matrix based multi-Q learning for a multi-robot system
—Multi-robot reinforcement learning is a very challenging area due to several issues, such as large state spaces, difficulty in reward assignment, nondeterministic action selecti...
Hongliang Guo, Yan Meng
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 5 months ago
Using group selection to evolve leadership in populations of self-replicating digital organisms
This paper describes a study in the evolution of distributed cooperative behavior, specifically leader election, through digital evolution and group selection. In digital evoluti...
David B. Knoester, Philip K. McKinley, Charles Ofr...
OTM
2007
Springer
14 years 5 months ago
Bayesian Analysis of Secure P2P Sharing Protocols
Ad hoc and peer-to-peer (P2P) computing paradigms pose a number of security challenges. The deployment of classic security protocols to provide services such as node authentication...
Esther Palomar, Almudena Alcaide, Juan M. Est&eacu...
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
14 years 5 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks