Sciweavers

14548 search results - page 355 / 2910
» The Optimal Path-Matching Problem
Sort
View
IEEEPACT
2006
IEEE
16 years 22 days ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
16 years 7 days ago
The enhanced evolutionary tabu search and its application to the quadratic assignment problem
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
John F. McLoughlin III, Walter Cedeño
HM
2005
Springer
98views Optimization» more  HM 2005»
16 years 6 days ago
A Hybrid GRASP with Data Mining for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
L. F. Santos, Marcos Henrique Ribeiro, Alexandre P...
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 10 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 10 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...