97 search results - page 5 / 20 » Near-Optimal Search in Continuous Domains |
111
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
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...
139
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—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...
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
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...
110
click to vote
DEXAW
2008
IEEE
15 years 3 months ago
2008
IEEE
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...
136
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
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...