2899 search results - page 135 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
147
click to vote
GRIDNETS
2008
15 years 6 months ago
2008
In this paper we propose an efficient approach to determine the optimal hops for multi-hop ad hoc wireless networks. Based on the assumption that nodes use successive interferenc...
109
click to vote
EOR
2007
15 years 5 months ago
2007
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
130
click to vote
IJFCS
2007
15 years 5 months ago
2007
Sense of direction is a property of the edge-labeling of a network whose availability facilitates computations and often decreases their complexity. In this paper we consider the ...
147
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
117
click to vote
TSP
2008
15 years 5 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...