Sciweavers

1026 search results - page 64 / 206
» An Optimal Solution to Room Search Problem
Sort
View
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 9 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 10 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
JVA
2006
IEEE
16 years 5 days ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
JUCS
2008
159views more  JUCS 2008»
15 years 6 months ago
Two Step Swarm Intelligence to Solve the Feature Selection Problem
: In this paper we propose a new approach to Swarm Intelligence called Two-Step Swarm Intelligence. The basic idea is to split the heuristic search performed by agents into two sta...
Yudel Gómez, Rafael Bello, Amilkar Puris, M...
MP
2008
60views more  MP 2008»
15 years 6 months ago
Extreme optics and the search for Earth-like planets
In this paper I describe a new and exciting application of optimization technology. The problem is to design a space telescope capable of imaging Earth-like planets around nearby s...
Robert J. Vanderbei