Sciweavers

4612 search results - page 833 / 923
» More Communications
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
FOSSACS
2005
Springer
14 years 2 months ago
Mathematical Models of Computational and Combinatorial Structures
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
Marcelo P. Fiore
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 9 months ago
PSIM: A tool for analysis of device pairing methods
Wireless networks are a common place nowadays and almost all of the modern devices support wireless communication in some form. These networks differ from more traditional computi...
Yasir Arfat Malkani, Lachhman Das Dhomeja
ATAL
2009
Springer
14 years 3 months ago
Decentralised coordination of continuously valued control parameters using the max-sum algorithm
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
Ruben Stranders, Alessandro Farinelli, Alex Rogers...
SIGMETRICS
2003
ACM
115views Hardware» more  SIGMETRICS 2003»
14 years 2 months ago
Measuring the effects of internet path faults on reactive routing
Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path per...
Nick Feamster, David G. Andersen, Hari Balakrishna...