1403 search results - page 106 / 281 » About Approximations of Exponentials |
133
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
128
click to vote
EOR
2006
15 years 4 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
123
click to vote
MANSCI
2008
15 years 4 months ago
2008
Continuing research by Jennings, Mandelbaum, Massey and Whitt (1996), we investigate methods to perform time-dependent staffing for many-server queues. Our aim is to achieve time-...
156
click to vote
SIGMETRICS
2008
ACM
15 years 4 months ago
2008
ACM
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
173
click to vote
SIAMREV
2010
14 years 11 months ago
2010
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...