Next: University of Durham
Up: Current Institutional Reports
Previous: CERFACS
Delft University of Technology
- 1
-
M. Verlaan.
Convergence of the RRSQRT algorithm for large scale Kalman
filtering problems.
Technical Report 97-19, Delft University of Technology, 1997.
- 2
-
S. Lipovetsky and F.A. Lootsma.
Generalized golden sections, repeated bisections, and aesthetic
preference.
Technical Report 97-20, Delft University of Technology, 1997.
- 3
-
T. Illes, C. Roos, and T. Terlaky.
Polynomial affine-scaling algorithms for P(K) linear
complementarity problems.
Technical Report 97-21, Delft University of Technology, 1997.
- 4
-
A.J. van Zanten and Agung Lukito.
Lower bounds for the maximal range of cyclic á m,nñ -codes.
Technical Report 97-22, Delft University of Technology, 1997.
- 5
-
P.Wesseling, A. Segal, C.G.M. Kassels, and H. Bijl.
Computing flows on general three-dimensional nonsmooth staggered
grids.
Technical Report 97-23, Delft University of Technology, 1997.
- 6
-
H. van Haeringen.
Pfaff-Kummer-type transformation in relation to some bilateral
hypergeometric functions.
Technical Report 97-24, Delft University of Technology, 1997.
- 7
-
K. Fukuda and T. Terlaky.
Criss-cross methods: A fresh view on pivot algorithms.
Technical Report 97-26, Delft University of Technology, 1997.
- 8
-
Dmitrii V. Pasechnik.
On transitive permutation groups with primitive subconstituents.
Technical Report 97-27, Delft University of Technology, 1997.
- 9
-
E. de Klerk, C. Roos, and T. Terlaky.
A short survey on semidefinite programming.
Technical Report 97-28, Delft University of Technology, 1997.
- 10
-
E. de Klerk, C. Roos, and T. Terlaky.
Primal-dual potential reduction methods for semidefinite programming
using affine-scaling directions.
Technical Report 97-29, Delft University of Technology, 1997.
- 11
-
L.D. Aronson.
Node homogeneous routing for node homogeneous traffic patterns on
meshes.
Technical Report 97-30, Delft University of Technology, 1997.
- 12
-
R.M. Burton, T. Coffey F.M. Dekking, and K. Hyman.
Fractal percolation with neighbour interaction.
Technical Report 97-31, Delft University of Technology, 1997.
- 13
-
H. Bavink.
Differential and difference operators having orthogonal polynomials
with two linear perturbations as eigenfunctions.
Technical Report 97-32, Delft University of Technology, 1997.
- 14
-
Bernd Heidergott.
Infinitesimal perturbation analysis for queuing networks with general
service time distributions.
Technical Report 97-33, Delft University of Technology, 1997.
- 15
-
Zhi-Quan Luo, Kees Roos, and Tamas Terlaky.
Complexity analysis of a logarithmic barrier decomposition method for
semi-infinite linear programming.
Technical Report 97-34, Delft University of Technology, 1997.
- 16
-
Hans van Maaren and Joost P. Warners.
Bounds and fast approximation algorithmics for binary quadratic
optimization problems with application to MAX2SAT and MAX CUT.
Technical Report 97-35, Delft University of Technology, 1997.
- 17
-
T. Illes and D. Pissinger.
Upper bounds on the covering number of Galois-planes with small
order.
Technical Report 97-36, Delft University of Technology, 1997.
Tom Rowan
Fri Oct 31 08:43:54 EST 1997