6365 search results - page 480 / 1273 » Fast Local Computation Algorithms |
195
click to vote
WDAG
2009
Springer
16 years 6 days ago
2009
Springer
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
219
click to vote
COMPGEOM
2003
ACM
16 years 28 days ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
210
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
184
click to vote
FSTTCS
2001
Springer
16 years 5 days ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
210
click to vote
ICC
2009
IEEE
16 years 2 months ago
2009
IEEE
— In this paper, a distributed power control algorithm is proposed for wireless relay networks in interference-limited environments. The objective is to minimize the total transm...