Sciweavers

5153 search results - page 432 / 1031
» Introduction to Randomized Algorithms
Sort
View
183
Voted
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 7 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
AAAI
2012
13 years 7 months ago
Robust Cuts Over Time: Combatting the Spread of Invasive Species with Unreliable Biological Control
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
Gwen Spencer
CP
2009
Springer
16 years 5 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
ICRA
2008
IEEE
165views Robotics» more  ICRA 2008»
15 years 11 months ago
An almost communication-less approach to task allocation for multiple Unmanned Aerial Vehicles
— In this paper, we present a scalable, decentralized task allocation algorithm for a group of unknown number of Unmanned Aerial Vehicles (UAVs), which are equipped with GPS rece...
Peng Cheng, Vijay Kumar
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 10 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld