503 search results - page 35 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
137
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
114
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
108
click to vote
WABI
2005
Springer
15 years 9 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
151
Voted
RECOMB
2010
Springer
15 years 1 months ago
2010
Springer
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
120
Voted
DAC
1994
ACM
15 years 7 months ago
1994
ACM
An e cient solution to the wire sizing problem WSP usingthe Elmoredelaymodelisproposed. Two formulations of the problem are put forth: in the rst, the minimum interconnect delay i...