Sciweavers

151 search results - page 29 / 31
» Optimal Acceptors and Optimal Proof Systems
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
AE
2005
Springer
14 years 1 months ago
Evolutionary Design of a DDPD Model of Ligation
Ligation is a form of chemical self-assembly that involves dynamic formation of strong covalent bonds in the presence of weak associative forces. We study an extremely simple form ...
Mark A. Bedau, Andrew Buchanan, Gianluca Gazzola, ...
SPAA
2010
ACM
14 years 11 days ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
ATAL
2006
Springer
13 years 11 months ago
Learning the task allocation game
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
Sherief Abdallah, Victor R. Lesser
ICIW
2009
IEEE
14 years 2 months ago
Paircoding: Improving File Sharing Using Sparse Network Codes
BitTorrent and Practical Network Coding are efficient methods for sharing files in a peer-to-peer network. Both face the problem to distribute a given file using peers with dif...
Christian Ortolf, Christian Schindelhauer, Arne Va...