6546 search results - page 244 / 1310 » Improving the Performance of the RISE Algorithm |
163
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
157
click to vote
EVOW
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper i...
177
click to vote
CEC
2005
IEEE
16 years 4 days ago
2005
IEEE
When evolutionary algorithms are used for solving numerical constrained optimization problems, how to deal with the relationship between feasible and infeasible individuals can dir...
146
click to vote
ICCS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We propose the use of programmable Grid resource partitioning heuristics in the context of a distributed service Grid management architecture. The architecture is capable...
202
click to vote
MOBIHOC
2000
ACM
15 years 11 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....