Sciweavers

1138 search results - page 82 / 228
» Feature Markov Decision Processes
Sort
View
ICTAI
2005
IEEE
15 years 6 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
AAAI
2012
13 years 3 months ago
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
Frans Adriaan Oliehoek, Matthijs T. J. Spaan
ICASSP
2011
IEEE
14 years 4 months ago
Subspace pursuit method for kernel-log-linear models
This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...
Yotaro Kubo, Simon Wiesler, Ralf Schlüter, He...
147
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Feature selection based on Multiple Kernel Learning for single-channel sound source localization using the acoustic transfer fun
This paper presents a sound source (talker) localization method using only a single microphone. In our previous work [1], we discussed the single-channel sound source localization...
Ryoichi Takashima, Tetsuya Takiguchi, Yasuo Ariki
ECAI
1998
Springer
15 years 5 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein