Sciweavers

522 search results - page 4 / 105
» The 3-Steiner Root Problem
Sort
View
SIAMCO
2008
81views more  SIAMCO 2008»
13 years 8 months ago
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
Ming Cao, A. Stephen Morse, Brian D. O. Anderson
ANTS
2008
Springer
83views Algorithms» more  ANTS 2008»
13 years 10 months ago
Enumeration of Totally Real Number Fields of Bounded Root Discriminant
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
John Voight
WSC
2007
13 years 11 months ago
Finite-sample performance guarantees for one-dimensional stochastic root finding
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
Samuel Ehrlichman, Shane G. Henderson
DAM
2000
86views more  DAM 2000»
13 years 8 months ago
A supertree method for rooted trees
Abstract. The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classification, particularly...
Charles Semple, Mike A. Steel
COMPGEOM
2001
ACM
14 years 7 days ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...