Sciweavers

1376 search results - page 50 / 276
» Searching Trees: An Essay
Sort
View
IJCBDD
2008
113views more  IJCBDD 2008»
14 years 12 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 4 days ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
COCOA
2010
Springer
14 years 10 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
IJAIT
2002
82views more  IJAIT 2002»
14 years 11 months ago
Interleaved Backtracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...
Youssef Hamadi
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 5 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...