13376 search results - page 473 / 2676 » Problem Solving with |
168
Voted
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
Many algorithms such as Q-learning successfully address reinforcement learning in single-agent multi-time-step problems. In addition there are methods that address reinforcement l...
161
Voted
EXPCS
2007
15 years 10 months ago
2007
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
259
Voted
PAMI
2011
15 years 1 months ago
2011
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
152
Voted
NCA
2005
IEEE
15 years 11 months ago
2005
IEEE
Protocol composition frameworks provide off-the-shelf composable protocols to simplify the development of custom protocol stacks. All recent protocol frameworks use a general-purp...
163
click to vote
ECML
2007
Springer
16 years 9 days ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...