890 search results - page 21 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
118
Voted
HEURISTICS
2008
15 years 1 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
119
click to vote
EOR
2007
15 years 1 months ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
AIPS
2010
15 years 4 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
229
Voted
JCDL
2011
ACM
14 years 4 months ago
2011
ACM
Various approaches for plagiarism detection exist. All are based on more or less sophisticated text analysis methods such as string matching, fingerprinting or style comparison. I...
AI
2008
Springer
15 years 2 months ago
2008
Springer
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...