Sciweavers

698 search results - page 57 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
JDCTA
2010
146views more  JDCTA 2010»
13 years 4 months ago
Modelling for Cruise Two-Dimensional Online Revenue Management System
To solve the cruise two-dimensional revenue management problem and develop such an automated system under uncertain environment, a static model which is a stochastic integer progr...
Bingzhou Li
IJCAI
2001
13 years 10 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
12 years 9 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
TOMACS
2010
79views more  TOMACS 2010»
13 years 3 months ago
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
Sumit Kunnumkal, Huseyin Topaloglu