341 search results - page 23 / 69 » Learning to satisfy |
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
Content-targeted advertising, the task of automatically associating ads to a Web page, constitutes a key Web monetization strategy nowadays. Further, it introduces new challenging...
WAIM
2004
Springer
14 years 25 days ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Modeling synthetic characters which interact with objects in dynamic virtual worlds is important when we want the agents to act in an autonomous and non-preplanned way. Such inter...
IJAMCIGI
2010
13 years 4 months ago
2010
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...
JMLR
2010
13 years 2 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...