152 search results - page 29 / 31 » Robust Polynomials and Quantum Algorithms |
MP
2002
13 years 8 months ago
2002
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
WADS
1997
Springer
14 years 16 days ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
DFG
2009
Springer
14 years 3 months ago
2009
Springer
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
SIAMSC
2010
13 years 3 months ago
2010
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...