Sciweavers

1612 search results - page 28 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
EURONGI
2006
Springer
13 years 11 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer
GLOBECOM
2009
IEEE
14 years 2 months ago
Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems
— A radio frequency identification (RFID) system consists of a set of readers and several objects, equipped with small computer chips, called tags. In a dense RFID system, where...
Amir Hamed Mohsenian Rad, Vahid Shah-Mansouri, Vin...
CVPR
2009
IEEE
15 years 2 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
Interactive image segmentation traditionally involves the use of algorithms such as Graph Cuts or Random Walker. Common concerns with using Graph Cuts are metrication artifacts ...
Dheeraj Singaraju, Leo Grady, René Vidal
ADHOCNOW
2008
Springer
13 years 8 months ago
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
PPSN
2010
Springer
13 years 5 months ago
Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
Olaf Mersmann, Mike Preuss, Heike Trautmann