Sciweavers

1185 search results - page 72 / 237
» The Equivalence of Sampling and Searching
Sort
View
113
Voted
MICAI
2005
Springer
15 years 6 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
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...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
96
Voted
ACG
2003
Springer
15 years 5 months ago
Searching with Analysis of Dependencies in a Solitaire Card Game
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...
Bernard Helmstetter, Tristan Cazenave
CHI
2003
ACM
16 years 27 days ago
Faceted metadata for image search and browsing
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...
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 6 months ago
Factorial representations to generate arbitrary search distributions
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 ...
Marc Toussaint
129
Voted
ATAL
2008
Springer
15 years 2 months ago
Searching for approximate equilibria in empirical games
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...