Sciweavers

7930 search results - page 102 / 1586
» Greedy in Approximation Algorithms
Sort
View
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
15 years 11 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 11 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
PPSN
2004
Springer
15 years 11 months ago
A Hybrid GRASP - Evolutionary Algorithm Approach to Golomb Ruler Search
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...
Carlos Cotta, Antonio J. Fernández
SAC
2004
ACM
15 years 11 months ago
GD-GhOST: a goal-oriented self-tuning caching algorithm
A popular solution to internet performance problems is the widespread caching of data. Many caching algorithms have been proposed in the literature, most attempting to optimize fo...
Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chry...
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 10 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro