Sciweavers

879 search results - page 57 / 176
» Greedy Attribute Selection
Sort
View
AIPS
2006
15 years 5 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
IPM
2007
99views more  IPM 2007»
15 years 4 months ago
Older versions of the ROUGEeval summarization evaluation system were easier to fool
We show some limitations of the ROUGE evaluation method for automatic summarization. We present a method for automatic summarization based on a Markov model of the source text. By...
Jonas Sjöbergh
JMLR
2002
100views more  JMLR 2002»
15 years 4 months ago
On the Convergence of Optimistic Policy Iteration
We consider a finite-state Markov decision problem and establish the convergence of a special case of optimistic policy iteration that involves Monte Carlo estimation of Q-values,...
John N. Tsitsiklis
SIGMOD
1996
ACM
116views Database» more  SIGMOD 1996»
15 years 8 months ago
Optimizing Queries over Multimedia Repositories
Repositories of multimedia objects having multiple types of attributes e.g., image, text are becoming increasingly common. A selection on these attributes will typically produce n...
Surajit Chaudhuri, Luis Gravano
MOBICOM
2006
ACM
15 years 10 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic