1277 search results - page 115 / 256 » Terminating Decision Algorithms Optimally |
132
click to vote
EMO
2009
Springer
15 years 10 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
127
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—We investigate the design of a clean-slate control and nt plane for data networks using the abstraction of 4D architecture, utilizing and extending 4D’s concept of logically c...
217
Voted
ICAART
2010
INSTICC
16 years 16 days ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
113
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
113
Voted
STOC
1995
ACM
15 years 7 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,...