Sciweavers

1347 search results - page 127 / 270
» On the Structure of the Minimum Time Function
Sort
View
130
Voted
QUESTA
2002
86views more  QUESTA 2002»
15 years 3 months ago
Optimality of D-Policies for an M/G/1 Queue with a Removable Server
We consider an M/G/1 queue with a removable server. When a customer arrives, the workload becomes known. The cost structure consists of switching costs, running costs, and holding ...
Eugene A. Feinberg, Offer Kella
CSL
1999
Springer
15 years 8 months ago
Difference Decision Diagrams
This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form ¡£¢¥¤§¦©¨ and ¡¢¥¤Â...
Jesper B. Møller, Jakob Lichtenberg, Henrik...
124
Voted
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 9 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk
ICFP
2007
ACM
16 years 4 months ago
Stream fusion: from lists to streams to nothing at all
This paper presents an automatic deforestation system, stream fusion, based on equational transformations, that fuses a wider range of functions than existing short-cut fusion sys...
Duncan Coutts, Roman Leshchinskiy, Don Stewart
136
Voted
CLOUDCOM
2009
Springer
15 years 8 months ago
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
Nicolas G. Grounds, John K. Antonio, Jeffrey T. Mu...