Sciweavers

1672 search results - page 59 / 335
» Tightness problems in the plane
Sort
View
FCT
2003
Springer
14 years 2 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
14 years 3 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
HPDC
2007
IEEE
14 years 3 months ago
Smartsockets: solving the connectivity problems in grid computing
Tightly coupled parallel applications are increasingly run in Grid environments. Unfortunately, on many Grid sites the ability of machines to create or accept network connections ...
Jason Maassen, Henri E. Bal
ICTCS
2005
Springer
14 years 2 months ago
Inapproximability Results for the Lateral Gene Transfer Problem
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakr...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 3 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl