Sciweavers

223 search results - page 24 / 45
» Proving Termination by Bounded Increase
Sort
View
PODC
2011
ACM
13 years 1 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
SECON
2010
IEEE
13 years 8 months ago
Back-Tracking Based Sensor Deployment by a Robot Team
Existing solutions to carrier-based sensor placement by a single robot, in a bounded unknown region of interest (ROI), do not guarantee full area coverage and/or do not terminate. ...
Greg Fletcher, Xu Li, Amiya Nayak, Ivan Stojmenovi...
ICML
2010
IEEE
13 years 8 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
AAAI
2012
12 years 1 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
SPAA
2009
ACM
14 years 5 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski