4488 search results - page 428 / 898 » Focusing Search by Using Problem Solving Experience |
142
click to vote
NIPS
1997
15 years 7 months ago
1997
We present a new approach to reinforcement learning in which the policies considered by the learning process are constrained by hierarchies of partially specified machines. This ...
157
Voted
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
113
click to vote
ER
1987
Springer
15 years 9 months ago
1987
Springer
We report on experience with database user interfaces that are entity-relationship oriented, rather than relation-oriented, and provide a new level of ease-of-use for information ...
142
click to vote
NIPS
2004
15 years 7 months ago
2004
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...
161
click to vote
ANOR
2002
15 years 6 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...