Sciweavers

15485 search results - page 178 / 3097
» Computing Optimal Subsets
Sort
View
GECCO
2005
Springer
15 years 11 months ago
XCS with computed prediction in multistep environments
XCSF extends the typical concept of learning classifier sys
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
POPL
1997
ACM
15 years 9 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
PAMI
2011
15 years 1 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
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 ...
Pedro F. Felzenszwalb, Ramin Zabih
ICML
2002
IEEE
16 years 7 months ago
Action Refinement in Reinforcement Learning by Probability Smoothing
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
Carles Sierra, Dídac Busquets, Ramon L&oacu...
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
16 years 14 days ago
Thoughts on solution concepts
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...
Anthony Bucci, Jordan B. Pollack