Sciweavers

97 search results - page 5 / 20
» Near-Optimal Search in Continuous Domains
Sort
View
ICML
2009
IEEE
14 years 10 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis
INFOCOM
2011
IEEE
13 years 1 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
ICPR
2006
IEEE
14 years 10 months ago
Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...
Martin de La Gorce, Nikos Paragios
DEXAW
2008
IEEE
136views Database» more  DEXAW 2008»
13 years 11 months ago
Segmentation of Legislative Documents Using a Domain-Specific Lexicon
The amount of legal information is continuously growing. New legislative documents appear everyday in the Web. Legal documents are produced on a daily basis in briefingformat, cont...
Ismael Hasan, Javier Parapar, Roi Blanco
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 3 months ago
XCSF with computed continuous action
Wilson introduced XCSF as a successor to XCS. The major development of XCSF is the concept of a computed prediction. The efficiency of XCSF in dealing with numerical input and con...
Trung Hau Tran, Cédric Sanza, Yves Duthen, ...