5109 search results - page 129 / 1022 » On Learning Limiting Programs |
138
click to vote
ICTAI
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
138
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
141
click to vote
ICML
1995
IEEE
16 years 5 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
162
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
145
click to vote
ICMLC
2010
Springer
15 years 3 months ago
2010
Springer
: This paper focused on designing of a ubiquitous interface agent based on the ontology technology and interaction diagram with the backend information agent system, i.e., OntoIAS,...