2440 search results - page 206 / 488 » Abstraction Learning |
148
click to vote
ML
2010
ACM
15 years 2 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
138
click to vote
ICMLA
2009
15 years 2 months ago
2009
components of a system by susceptibility to failure. In this extended abstract, we present an ongoing project to rank the underground primary feeders of Consolidated Edison Company...
171
Voted
KSEM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
204
click to vote
SAGA
2009
Springer
15 years 11 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
111
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— As robots become more commonplace within society, the need for tools to enable non-robotics-experts to develop control algorithms, or policies, will increase. Learning ...