1603 search results - page 126 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
148
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...
173
click to vote
EGH
2005
Springer
16 years 4 days ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
196
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
158
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
169
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...