Sciweavers

1927 search results - page 126 / 386
» UMDAs for dynamic optimization problems
Sort
View
117
Voted
EOR
2008
75views more  EOR 2008»
15 years 26 days ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
122
Voted
TCSV
2008
128views more  TCSV 2008»
15 years 21 days ago
Compression-Aware Energy Optimization for Video Decoding Systems With Passive Power
The objective of dynamic voltage scaling (DVS) is to adapt the frequency and voltage for configurable platforms to obtain energy savings. DVS is especially attractive for video dec...
Emrah Akyol, Mihaela van der Schaar
84
Voted
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
16 years 1 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
229
Voted
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 1 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
108
Voted
ICC
2007
IEEE
122views Communications» more  ICC 2007»
15 years 7 months ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi