3320 search results - page 149 / 664 » Heuristics for the Phylogeny Problem |
220
click to vote
OL
2011
15 years 1 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
160
click to vote
HEURISTICS
2008
15 years 6 months ago
2008
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
152
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
163
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
163
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...