2714 search results - page 115 / 543 » Approximation Schemes for Scheduling |
117
Voted
WADS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
117
Voted
UAI
2004
15 years 2 months ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
105
click to vote
MOC
2010
14 years 7 months ago
2010
We consider temporal approximation of stationary statistical properties of dissipative complex dynamical systems. We demonstrate that stationary statistical properties of the time...
126
Voted
CN
2006
15 years 21 days ago
2006
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
116
click to vote
Publication
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...