Sciweavers

376 search results - page 15 / 76
» Solution Counting Algorithms for Constraint-Centered Search ...
Sort
View
CEC
2008
IEEE
14 years 2 months ago
On the usefulness of infeasible solutions in evolutionary search: A theoretical study
— Evolutionary algorithms (EAs) have been widely used in optimization, where infeasible solutions are often encountered. Some EAs regard infeasible solutions as useless individua...
Yang Yu, Zhi-Hua Zhou
ICRA
2000
IEEE
124views Robotics» more  ICRA 2000»
14 years 3 days ago
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Joaquín Bautista, Raúl Suárez...
CAAN
2007
Springer
13 years 11 months ago
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
Dirk Richter, Boris Goldengorin, Gerold Jäger...
APDC
1997
13 years 9 months ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
Ishfaq Ahmad, Muhammad Kafil
STACS
2005
Springer
14 years 1 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt