Sciweavers

801 search results - page 27 / 161
» Minimal Locked Trees
Sort
View
EOR
2006
130views more  EOR 2006»
14 years 9 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
RECOMB
2011
Springer
14 years 15 days ago
Algorithms for MDC-Based Multi-locus Phylogeny Inference
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...
Yun Yu, Tandy Warnow, Luay Nakhleh
JQL
2008
97views more  JQL 2008»
14 years 9 months ago
Dependency-length minimization in natural and artificial languages
A wide range of evidence points to a preference for syntactic structures in which dependencies are short. Here we examine the question: what kinds of dependency configurations min...
David Temperley
DAC
1998
ACM
15 years 10 months ago
Layout Techniques for Minimizing On-Chip Interconnect Self Inductance
Because magnetic e ects have a much longer spatial range than electrostatic e ects, an interconnect line with large inductance will be sensitive to distant variations in interconn...
Yehia Massoud, Steve S. Majors, Tareq Bustami, Jac...
CCCG
2001
14 years 11 months ago
Nearest neighbor search through function minimization
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
Chang Shu, Michael A. Greenspan, Guy Godin