5055 search results - page 220 / 1011 » Relative Timing |
155
click to vote
WG
2001
Springer
15 years 11 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
179
click to vote
ADAEUROPE
2003
Springer
15 years 11 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
125
click to vote
CISS
2008
IEEE
16 years 29 days ago
2008
IEEE
—In this paper we consider the behaviour of both primal and dual multi-path algorithms for a simple network of three resources. We examine the equilibrium behaviour of our models...
119
click to vote
EOR
2008
15 years 6 months ago
2008
In this paper we consider a single item, discrete time, lot sizing situation where demand is random and its parameters (e.g., mean and standard deviation) can change with time. Fo...
223
click to vote
ESA
2007
Springer
16 years 20 days ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...