2899 search results - page 145 / 580 » Dynamic Trees in Practice |
SGP
2004
14 years 1 days ago
2004
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
ICUMT
2009
13 years 7 months ago
2009
In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed throu...
TRANSCI
2011
13 years 4 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
WSC
1997
13 years 11 months ago
1997
Excellent production design and planning depends on accurate simulation of a high quality layout. A good layout project will always begin with an analysis of the production volume...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...