2714 search results - page 131 / 543 » Approximation Schemes for Scheduling |
88
Voted
PEPM
1991
ACM
15 years 4 months ago
1991
ACM
This is a follow-on to my 1988PLDIpaper, “Control-Flow Analysis e”[9]. Iusethe methodofabstractsemanticinterpretations to explicate the control-flow analysis technique presen...
89
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the...
94
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...
143
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
111
Voted
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We extend the hyperdynamics method developed for lowdimensional energy-dominated systems, to simulate slow dynamics in more general atomistic systems. We show that a few ...