3352 search results - page 216 / 671 » Hierarchical Problem Solving and the Bayesian Optimization A... |
151
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
203
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Robustness of optimization models for networking problems has been an under-explored area. Yet most existing algorithms for solving robust optimization problems are centralized,...
204
click to vote
CONSTRAINTS
2010
15 years 6 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
158
click to vote
HASE
1998
IEEE
15 years 11 months ago
1998
IEEE
An important practical problem in fault diagnosis is discriminating between permanent faults and transient faults. In many computer systems, the majority of errors are due to tran...
174
click to vote
CPAIOR
2005
Springer
16 years 4 days ago
2005
Springer
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...