2899 search results - page 145 / 580 » Dynamic Trees in Practice |
142
Voted
SGP
2004
15 years 5 months 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...
107
Voted
ICUMT
2009
15 years 15 days 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...
99
Voted
TRANSCI
2011
14 years 9 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...
124
click to vote
WSC
1997
15 years 4 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...
136
Voted
STOC
2006
ACM
16 years 3 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...