Sciweavers

6102 search results - page 256 / 1221
» Generating Optimizing Specializers
Sort
View
PE
2008
Springer
106views Optimization» more  PE 2008»
15 years 23 days ago
Time-dependent performance analysis of a discrete-time priority queue
We present the transient analysis of the system content in a two-class discrete-time MX /D/1 priority queue. In particular, we derive an expression for the generating function of ...
Joris Walraevens, Dieter Fiems, Herwig Bruneel
104
Voted
CGO
2010
IEEE
15 years 7 months ago
Parameterized tiling revisited
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
Muthu Manikandan Baskaran, Albert Hartono, Sanket ...
104
Voted
ICFP
2008
ACM
16 years 23 days ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
UAI
2003
15 years 2 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
103
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 1 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking