3825 search results - page 569 / 765 » More on pooling spaces |
184
click to vote
AAAI
2007
15 years 9 months ago
2007
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
203
click to vote
AAAI
2007
15 years 9 months ago
2007
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
186
click to vote
AAAI
2008
15 years 9 months ago
2008
An important feature of many problem domains in machine learning is their geometry. For example, adjacency relationships, symmetries, and Cartesian coordinates are essential to an...
185
click to vote
DLOG
2007
15 years 9 months ago
2007
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w...
133
click to vote
AIPS
2008
15 years 9 months ago
2008
In recent work we showed that models constructed from planner performance data over a large suite of benchmark problems are surprisingly accurate; 91-99% accuracy for success and ...