Sciweavers

675 search results - page 28 / 135
» Online stochastic optimization under time constraints
Sort
View
CJ
2004
141views more  CJ 2004»
13 years 8 months ago
Modeling and Analysis of a Scheduled Maintenance System: a DSPN Approach
This paper describes a way to manage the modeling and analysis of Scheduled Maintenance Systems (SMS) within an analytically tractable context. We chose a significant case study h...
Andrea Bondavalli, Roberto Filippini
VLSISP
2002
112views more  VLSISP 2002»
13 years 8 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
RSS
2007
129views Robotics» more  RSS 2007»
13 years 10 months ago
Spatially-Adaptive Learning Rates for Online Incremental SLAM
— Several recent algorithms have formulated the SLAM problem in terms of non-linear pose graph optimization. These algorithms are attractive because they offer lower computationa...
Edwin Olson, John J. Leonard, Seth J. Teller
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
14 years 3 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 10 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova