Sciweavers

4277 search results - page 87 / 856
» On Multiple Linear Approximations
Sort
View
TON
1998
90views more  TON 1998»
15 years 3 months ago
Effective bandwidths with priorities
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...
Arthur W. Berger, Ward Whitt
158
Voted
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 3 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
HYBRID
2003
Springer
15 years 9 months ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
RECOMB
2006
Springer
16 years 4 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret
DAM
2008
102views more  DAM 2008»
15 years 3 months ago
Formulas for approximating pseudo-Boolean random variables
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...
Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. ...