Search Sciweavers | Sciweavers

We study the asymptotic probability that a random composition of an integer n is gap-free, that is, that the sizes of parts in the composition form an interval. We show that this ...

Pawel Hitczenko, Arnold Knopfmacher

claim paper

Read More »

14

click to vote

ALENEX
2004

120views Algorithms» more ALENEX 2004»

Compositions and Patricia Tries: No Fluctuations in the Variance!

13 years 6 months ago

Download finanz.math.tu-graz.ac.at

We prove that the variance of the number of different letters in random words of length n, with letters i and probabilities 2-i attached to them, is 1 + o(1). Likewise, the varian...

Helmut Prodinger

claim paper

Read More »

9

click to vote

ALENEX
2001

101views Algorithms» more ALENEX 2001»

CNOP - A Package for Constrained Network Optimization

13 years 6 months ago

Download www.mpi-inf.mpg.de

Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...

Kurt Mehlhorn, Mark Ziegelmann

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers