Sciweavers

3320 search results - page 133 / 664
» Heuristics for the Phylogeny Problem
Sort
View
PDCAT
2005
Springer
16 years 23 hour ago
Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
Hannes Schabauer, Erich Schikuta, Thomas Weish&aum...
EOR
2007
163views more  EOR 2007»
15 years 6 months ago
The multi-depot vehicle routing problem with inter-depot routes
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heurist...
Benoit Crevier, Jean-François Cordeau, Gilb...
DATE
2008
IEEE
105views Hardware» more  DATE 2008»
16 years 1 months ago
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
Miroslav N. Velev, Ping Gao 0002
IJCAI
2003
15 years 8 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
ICMCS
2000
IEEE
110views Multimedia» more  ICMCS 2000»
15 years 11 months ago
Multi-clip Query Optimization in Video Databases
A multi-clip query requests multiple video clips. In this paper we address the multi-clip query optimization problem. We propose a new heuristics called Restricted Search Interval...
Ahmed Mostefaoui, Lionel Brunie, Harald Kosch, L&a...