Sciweavers

2626 search results - page 461 / 526
» The complexity of stochastic sequences
Sort
View
CN
2000
84views more  CN 2000»
15 years 6 months ago
Persistent route oscillations in inter-domain routing
Hop-by-hop inter-domain routing protocols, such as BGP and IDRP, use independent route selection to realize domains' local policies. A domain chooses its routes based on path...
Kannan Varadhan, Ramesh Govindan, Deborah Estrin
ENVSOFT
2000
70views more  ENVSOFT 2000»
15 years 6 months ago
Modeling soil pile bioremediation
A model is presented for the analysis of bioremediation applied to an ex situ soil pile. The approach is based on the remediation of a pile containing the contaminated soil, which...
Fehmidakhatun A. Mesania, Aaron A. Jennings
ORL
2000
77views more  ORL 2000»
15 years 6 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
DCG
1998
53views more  DCG 1998»
15 years 6 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
JACM
2002
94views more  JACM 2002»
15 years 6 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers