Sciweavers

332 search results - page 62 / 67
» Traveling salesman path problems
Sort
View
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
14 years 1 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
MIR
2006
ACM
172views Multimedia» more  MIR 2006»
14 years 1 months ago
Combining audio-based similarity with web-based data to accelerate automatic music playlist generation
We present a technique for combining audio signal-based music similarity with web-based musical artist similarity to accelerate the task of automatic playlist generation. We demon...
Peter Knees, Tim Pohle, Markus Schedl, Gerhard Wid...
ICNC
2005
Springer
14 years 1 months ago
Adaptive Parallel Ant Colony Algorithm
: Two strategies for information exchange between processors in parallel ant colony algorithm are presented. Theses strategies can make each processor choose other processors to co...
Ling Chen, Chunfang Zhang
HPDC
1997
IEEE
14 years 1 days ago
Supporting Parallel Applications on Clusters of Workstations: The Intelligent Network Interface Approach
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by highspeed ne...
Marcel-Catalin Rosu, Karsten Schwan, Richard Fujim...
BIOINFORMATICS
2007
123views more  BIOINFORMATICS 2007»
13 years 8 months ago
A comparative genome approach to marker ordering
Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The in...
Thomas Faraut, Simon de Givry, Patrick Chabrier, T...