Sciweavers

567 search results - page 27 / 114
» Exact train pathing
Sort
View
TSMC
2002
91views more  TSMC 2002»
14 years 11 months ago
On the sure criticality of tasks in activity networks with imprecise durations
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
Stefan Chanas, Didier Dubois, Pawel Zielinski
ACL
2006
15 years 1 months ago
Exploring Correlation of Dependency Relation Paths for Answer Extraction
In this paper, we explore correlation of dependency relation paths to rank candidate answers in answer extraction. Using the correlation measure, we compare dependency relations o...
Dan Shen, Dietrich Klakow
ML
2008
ACM
152views Machine Learning» more  ML 2008»
14 years 11 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
DICTA
2003
15 years 1 months ago
Gesture Classification Using Hidden Markov Models and Viterbi Path Counting
Human-Machine interfaces play a role of growing importance as computer technology continues to evolve. Motivated by the desire to provide users with an intuitive gesture input syst...
Nianjun Liu, Brian C. Lovell
JCP
2007
143views more  JCP 2007»
14 years 11 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio