82 search results - page 13 / 17 » Efficient theory combination via boolean search |
112
click to vote
ATAL
2010
Springer
14 years 12 months ago
2010
Springer
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
180
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
110
click to vote
SIGIR
2003
ACM
15 years 5 months ago
2003
ACM
Term-based representations of documents have found widespread use in information retrieval. However, one of the main shortcomings of such methods is that they largely disregard le...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
107
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...