129 search results - page 13 / 26 » Abstractive Meeting Summarization as a Markov Decision Proce... |
102
click to vote
CLUSTER
2002
IEEE
14 years 9 months ago
2002
IEEE
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
JSAC
2007
14 years 9 months ago
2007
— We consider the general problem of optimizing the performance of OBS networks with multiple traffic classes subject to strict (absolute) QoS constraints in terms of the end-to...
JCP
2008
14 years 10 months ago
2008
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the ...
CLEAR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper describes Pittsburgh Pattern Recognition's participation in the face detection and tracking tasks for the CLEAR 2006 evaluation. We first give a system ov...
DIALM
2000
ACM
15 years 2 months ago
2000
ACM
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...