Sciweavers

6740 search results - page 146 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
BMCBI
2007
154views more  BMCBI 2007»
13 years 10 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...
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
14 years 2 months ago
An approximation algorithm for the fault tolerant metric facility location problem
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
Kamal Jain, Vijay V. Vazirani
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 3 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
BIRTHDAY
1997
Springer
14 years 2 months ago
The Job Assignment Problem: A Study in Parallel and Distributed Machine Learning
This article describes a parallel and distributed machine learning approach to a basic variant of the job assignment problem. The approach is in the line of the multiagent learning...
Gerhard Weiß
ANOR
2002
67views more  ANOR 2002»
13 years 10 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith