1176 search results - page 197 / 236 » Theory and Applications of Robust Optimization |
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
ICCAD
2004
IEEE
15 years 8 months ago
2004
IEEE
Closed formed expressions for buffered interconnect delay approximation have been around for some time. However, previous approaches assume that buffers are free to be placed anyw...
PKDD
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
105
click to vote
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...