Sciweavers

476 search results - page 66 / 96
» Learning When to Use Lazy Learning in Constraint Solving
Sort
View
HIS
2008
14 years 11 months ago
REPMAC: A New Hybrid Approach to Highly Imbalanced Classification Problems
The class imbalance problem (when one of the classes has much less samples than the others) is of great importance in machine learning, because it corresponds to many critical app...
Hernán Ahumada, Guillermo L. Grinblat, Luca...
110
Voted
TROB
2011
112views more  TROB 2011»
14 years 4 months ago
Mapping and Pursuit-Evasion Strategies For a Simple Wall-Following Robot
— This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse...
Max Katsev, Anna Yershova, Benjamín Tovar, ...
IJCAI
2007
14 years 11 months ago
An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism
Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of ...
Ricardo M. Araujo, Luís C. Lamb
84
Voted
ICCBR
2005
Springer
15 years 3 months ago
Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
Sushil J. Louis, Chris Miles
SAT
2009
Springer
132views Hardware» more  SAT 2009»
15 years 4 months ago
Relaxed DPLL Search for MaxSAT
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
Lukas Kroc, Ashish Sabharwal, Bart Selman