Sciweavers

16082 search results - page 108 / 3217
» Fireworks Algorithm for Optimization
Sort
View
EOR
2008
91views more  EOR 2008»
15 years 2 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 6 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
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 6 months ago
Credit assignment in adaptive evolutionary algorithms
In this paper, a new method for assigning credit to search operators is presented. Starting with the principle of optimizing search bias, search operators are selected based on an...
James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker
111
Voted
MVA
1998
230views Computer Vision» more  MVA 1998»
15 years 4 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
113
Voted
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 4 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik