Sciweavers

522 search results - page 27 / 105
» The 3-Steiner Root Problem
Sort
View
COMPGEOM
2001
ACM
14 years 9 days ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 8 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 8 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
AISC
1998
Springer
14 years 27 days ago
Instantiation of Existentially Quantified Variables in Inductive Specification Proofs
Abstract. We present an automatic approach for instantiating existentially quantified variables in inductive specifications proofs. Our approach uses first-order meta-variables in ...
Brigitte Pientka, Christoph Kreitz
BROADBAND
1998
13 years 10 months ago
Blocking of dynamic multicast connections in a single link
In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. A service center at the root of a tree-type network pr...
Jouni Karvo, Jorma T. Virtamo, Samuli Aalto, Olli ...