3320 search results - page 267 / 664 » Heuristics for the Phylogeny Problem |
168
click to vote
NAS
2009
IEEE
16 years 1 months ago
2009
IEEE
- In this work, we study the problem of maximizing lightpath reliability in optical mesh networks against simultaneous failures of multiple fiber links without using protection sch...
169
click to vote
WEA
2007
Springer
16 years 26 days ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
149
click to vote
STACS
2004
Springer
16 years 3 days ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
166
click to vote
CAEPIA
2003
Springer
15 years 12 months ago
2003
Springer
We present a tool for solving and plotting train schedules which has been developed in collaboration with the National Network of Spanish Railways (RENFE). This tool transforms rai...
185
Voted
SSIAI
2002
IEEE
15 years 11 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...