84 search results - page 11 / 17 » Solving the Course Timetabling Problem with a Hybrid Heurist... |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
PROCEDIA
2011
12 years 10 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
ECAI
2004
Springer
14 years 28 days ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...