6095 search results - page 288 / 1219 » Learning in Local Search |
241
click to vote
ESANN
2008
15 years 8 months ago
2008
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
160
click to vote
ICTAI
2006
IEEE
16 years 20 days ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
162
click to vote
CONIELECOMP
2005
IEEE
16 years 7 days ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
151
click to vote
ADC
2004
Springer
16 years 1 days ago
2004
Springer
Web search engines crawl the web to fetch the data that they index. In this paper we re-examine that need, and evaluate the network costs associated with data acquisition, and alt...
138
click to vote
COCO
2004
Springer
16 years 21 hour ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...