Sciweavers

1734 search results - page 115 / 347
» MSDR-D Network Localization Algorithm
Sort
View
DC
2010
13 years 10 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
CCGRID
2005
IEEE
14 years 4 months ago
n-Cycle: a set of algorithms for task distribution on a commodity grid
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
Ladislau Bölöni, Damla Turgut, Dan C. Ma...
ICCSA
2009
Springer
14 years 5 months ago
A Performance Comparison of Swarm Intelligence Inspired Routing Algorithms for MANETs
Swarm Intelligence (SI) inspired routing algorithms have become a research focus in recent years due to their self-organizing nature, which is very suitable to the routing problems...
Jin Wang, Sungyoung Lee
VLDB
2005
ACM
115views Database» more  VLDB 2005»
14 years 3 months ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...
CP
2003
Springer
14 years 3 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano