2714 search results - page 131 / 543 » Approximation Schemes for Scheduling |
110
click to vote
PEPM
1991
ACM
15 years 7 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...
110
Voted
CORR
2010
Springer
15 years 29 days 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...
122
click to vote
CORR
2010
Springer
15 years 3 months 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 ...
163
Voted
INFOCOM
2010
IEEE
15 years 2 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...
132
Voted
ICCS
2007
Springer
15 years 9 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 ...