Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
We present a new method for taking advantage of the relative independence between parts of a single-player game. We describe an implementation for improving the search in a solitai...
There are currently two dominant interface types for searching and browsing large image collections: keywordbased search, and searching by overall similarity to sample images. We ...
Ka-Ping Yee, Kirsten Swearingen, Kevin Li, Marti A...
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...