2084 search results - page 253 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
166
click to vote
WASA
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
HYBRID
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of verifying reachability properties of stochastic real-time systems modeled as generalized semi-Markov processes (GSMPs). The standard simulation-based tec...
JMLR
2010
14 years 8 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
HPDC
2002
IEEE
15 years 2 months ago
2002
IEEE
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...