Sciweavers

3360 search results - page 193 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
IPPS
2005
IEEE
16 years 5 days ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
ALGOSENSORS
2006
Springer
15 years 10 months ago
A Flexible Algorithm for Sensor Network Partitioning and Self-partitioning Problems
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
Sandip Roy, Yan Wan, Ali Saberi
JETAI
2008
93views more  JETAI 2008»
15 years 6 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
IPPS
2003
IEEE
15 years 12 months ago
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
Yang Yang, Henri Casanova