Sciweavers

334 search results - page 50 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
112
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 9 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
JKM
2007
213views more  JKM 2007»
14 years 9 months ago
A systems-based dynamic knowledge transfer capacity model
Purpose – The purpose of this paper is twofold: to understand how recent developments in systems thinking and social construction can influence understanding of knowledge trans...
Robert Parent, Mario Roy, Denis St-Jacques
AAAI
2010
14 years 11 months ago
PUMA: Planning Under Uncertainty with Macro-Actions
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
Ruijie He, Emma Brunskill, Nicholas Roy
RTSS
2008
IEEE
15 years 4 months ago
Merge-by-Wire: Algorithms and System Support
Automakers are trying to make vehicles more intelligent and safe by embedding processors which can be used to implement by-wire applications for taking smart decisions on the road...
Vipul Shingde, Gurulingesh Raravi, Ashish Gudhe, P...
TIP
2008
169views more  TIP 2008»
14 years 9 months ago
Weakly Supervised Learning of a Classifier for Unusual Event Detection
In this paper, we present an automatic classification framework combining appearance based features and Hidden Markov Models (HMM) to detect unusual events in image sequences. One...
Mark Jager, Christian Knoll, Fred A. Hamprecht