Sciweavers

2694 search results - page 203 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
KES
2005
Springer
15 years 11 months ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
16 years 25 days 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
ICML
2009
IEEE
16 years 7 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng
UAI
2003
15 years 7 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...
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
15 years 11 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie