Sciweavers

91 search results - page 16 / 19
» Information-theoretic approaches to branching in search
Sort
View
NIPS
1993
14 years 10 months ago
Temporal Difference Learning of Position Evaluation in the Game of Go
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sej...
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
15 years 2 months ago
Multicriteria Network Design Using Evolutionary Algorithm
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
Rajeev Kumar, Nilanjan Banerjee
GECCO
2009
Springer
163views Optimization» more  GECCO 2009»
15 years 4 months ago
Dealing with inheritance in OO evolutionary testing
Most of the software developed in the world follows the object-oriented (OO) paradigm. However, the existing work on evolutionary testing is mainly targeted to procedural language...
Javier Ferrer, J. Francisco Chicano, Enrique Alba
CIKM
2011
Springer
13 years 9 months ago
Focusing on novelty: a crawling strategy to build diverse language models
Word prediction performed by language models has an important role in many tasks as e.g. word sense disambiguation, speech recognition, hand-writing recognition, query spelling an...
Luciano Barbosa, Srinivas Bangalore
IJCAI
1989
14 years 10 months ago
Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned Knowledge
This paper highlights a phenomenon that causes deductively learned knowledge to be harmful when used for problem solving. The problem occurs when deductive problem solvers encount...
Shaul Markovitch, Paul D. Scott