Sciweavers

326 search results - page 45 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
TCBB
2008
122views more  TCBB 2008»
13 years 9 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
ICPR
2006
IEEE
14 years 11 months ago
Combinatorial Surface Integration
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
Edwin R. Hancock, Roberto Fraile
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
14 years 3 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
NETWORKS
2010
13 years 8 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 4 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain