Sciweavers

179 search results - page 29 / 36
» Learning Relational Navigation Policies
Sort
View
ATAL
2007
Springer
14 years 1 months ago
Batch reinforcement learning in a complex domain
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
Shivaram Kalyanakrishnan, Peter Stone
HRI
2007
ACM
13 years 11 months ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 7 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
SAC
2010
ACM
14 years 2 months ago
A robust link-translating proxy server mirroring the whole web
Link-translating proxies are widely used for anonymous browsing, policy circumvention and WebVPN functions. These are implemented by encoding the destination URL in the path of th...
Ziqing Mao, Cormac Herley
ICALP
2011
Springer
12 years 11 months ago
Content Search through Comparisons
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....
Amin Karbasi, Stratis Ioannidis, Laurent Massouli&...