Sciweavers

678 search results - page 53 / 136
» The Theory of Weak Stabilization
Sort
View
SRDS
2010
IEEE
13 years 6 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
PODC
2010
ACM
14 years 25 days ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
POPL
2009
ACM
14 years 9 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
14 years 9 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
LICS
2003
IEEE
14 years 2 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva