Sciweavers

779 search results - page 135 / 156
» Information-theoretic Competitive Learning
Sort
View
AIIDE
2008
13 years 10 months ago
Intelligent Trading Agents for Massively Multi-player Game Economies
As massively multi-player gaming environments become more detailed, developing agents to populate these virtual worlds as capable non-player characters poses an increasingly compl...
John Reeder, Gita Sukthankar, Michael Georgiopoulo...
IFIP12
2008
13 years 9 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
NIPS
2008
13 years 9 months ago
An Online Algorithm for Maximizing Submodular Functions
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
Matthew J. Streeter, Daniel Golovin
NIPS
2007
13 years 9 months ago
Expectation Maximization and Posterior Constraints
The expectation maximization (EM) algorithm is a widely used maximum likelihood estimation procedure for statistical models when the values of some of the variables in the model a...
João Graça, Kuzman Ganchev, Ben Task...
AAAI
2004
13 years 9 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml