Sciweavers

1971 search results - page 11 / 395
» Tabu search - Uncharted domains
Sort
View
87
Voted
AIMSA
2008
Springer
15 years 3 months ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao
EVOW
2009
Springer
15 years 2 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
IJAIT
2007
119views more  IJAIT 2007»
14 years 9 months ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
AES
2006
Springer
97views Cryptology» more  AES 2006»
14 years 9 months ago
ADSS: An approach to determining semantic similarity
Determining the semantic similarity is an important issue in the development of semantic search technology. In this paper, we propose an approach to determining the semantic simil...
Lixin Han, Linping Sun, Guihai Chen, Li Xie
ANOR
2005
93views more  ANOR 2005»
14 years 9 months ago
Evolutionary Approaches to DNA Sequencing with Errors
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...
Jacek Blazewicz, Fred Glover, Marta Kasprzak