1277 search results - page 216 / 256 » Terminating Decision Algorithms Optimally |
123
Voted
AAAI
2008
15 years 5 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
160
Voted
ACMICEC
2008
ACM
15 years 5 months ago
2008
ACM
Conventional conversational recommender systems support interaction strategies that are hard-coded into the system in advance. In this context, Reinforcement Learning techniques h...
126
Voted
ML
2006
ACM
15 years 3 months ago
2006
ACM
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
112
Voted
CCE
2004
15 years 3 months ago
2004
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
124
Voted
TVLSI
2002
15 years 3 months ago
2002
In this paper, we propose a low-power approach to the design of embedded very long instruction word (VLIW) processor architectures based on the forwarding (or bypassing) hardware, ...