Sciweavers

2714 search results - page 73 / 543
» Approximation Schemes for Scheduling
Sort
View
114
Voted
ECRTS
2004
IEEE
15 years 4 months ago
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
Karsten Albers, Frank Slomka
WSC
2008
15 years 2 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
111
Voted
CP
2004
Springer
15 years 6 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
125
Voted
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
15 years 4 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
VLSID
2004
IEEE
111views VLSI» more  VLSID 2004»
16 years 27 days ago
On Buffering Schemes for Long Multi-Layer Nets
We consider the problem of minimizing the delay in signal transmission over point-to-point connections across multiple metal layers in a VLSI circuit. We present an exact solution...
Vani Prasad, Madhav P. Desai