Sciweavers

54 search results - page 7 / 11
» Fast Bounds on the Distribution of Smooth Numbers
Sort
View
TSP
2010
14 years 4 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
ICDCS
1997
IEEE
15 years 1 months ago
Distributed Recovery with K-Optimistic Logging
Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service down-time. Most industrial applicati...
Yi-Min Wang, Om P. Damani, Vijay K. Garg
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ICS
2010
Tsinghua U.
15 years 7 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SPAA
2006
ACM
15 years 3 months ago
Fault-tolerant semifast implementations of atomic read/write registers
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we st...
Chryssis Georgiou, Nicolas C. Nicolaou, Alexander ...