Sciweavers

779 search results - page 99 / 156
» Information-theoretic Competitive Learning
Sort
View
AAAI
2007
13 years 11 months ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch
CLEF
2010
Springer
13 years 10 months ago
Visual Localization Using Global Visual Features and Vanishing Points
Abstract. This paper describes a visual localization approach for mobile robots. Robot localization is performed as location recognition. The approach uses global visual features (...
Olivier Saurer, Friedrich Fraundorfer, Marc Pollef...
EC
2008
146views ECommerce» more  EC 2008»
13 years 9 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
BC
2002
85views more  BC 2002»
13 years 8 months ago
Invariant recognition of feature combinations in the visual system
The operation of a hierarchical competitive network model (VisNet) of invariance learning in the visual system is investigated to determine how this class of architecture can solve...
Martin C. M. Elliffe, Edmund T. Rolls, Simon M. St...
SIGKDD
2000
150views more  SIGKDD 2000»
13 years 8 months ago
KDD-Cup 2000 Organizers' Report: Peeling the Onion
We describe KDD-Cup 2000, the yearly competition in data mining. For the first time the Cup included insight problems in addition to prediction problems, thus posing new challenge...
Ron Kohavi, Carla E. Brodley, Brian Frasca, Llew M...