4114 search results - page 369 / 823 » Efficient Algorithms for the 2-Center Problems |
167
click to vote
SIAMJO
2010
15 years 1 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
159
click to vote
WDAG
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
146
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
166
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
203
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...