Sciweavers

549 search results - page 29 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
IPPS
1998
IEEE
15 years 1 months ago
SIMD and Mixed-Mode Implementations of a Visual Tracking Algorithm
This paper describes the implementation of a featurebased visual tracking algorithm on a SIMD MasPar MP-1 and the mixed-mode PASM prototype. The sequential algorithm is introduced...
Mark Bernd Kulaczewski, Howard Jay Siegel
PPSN
2010
Springer
14 years 8 months ago
A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
Darrell Whitley, Doug Hains, Adele E. Howe
PPSN
2010
Springer
14 years 8 months ago
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
Abel Garcia-Najera, John A. Bullinaria
MIDDLEWARE
2005
Springer
15 years 3 months ago
MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks
Abstract. Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and ...
Fengyun Cao, Jaswinder Pal Singh
68
Voted
BMCBI
2007
154views more  BMCBI 2007»
14 years 9 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...