Sciweavers

4860 search results - page 566 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ATAL
2006
Springer
15 years 8 months ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm
EMO
2006
Springer
107views Optimization» more  EMO 2006»
15 years 8 months ago
Designing Multi-objective Variation Operators Using a Predator-Prey Approach
In this paper, we propose a new conceptual method for the design, investigation, and evaluation of multi-objective variation operators for evolutionary multi-objective algorithms. ...
Christian Grimme, Joachim Lepping
AAAI
2007
15 years 7 months ago
Temporal Difference and Policy Search Methods for Reinforcement Learning: An Empirical Comparison
Reinforcement learning (RL) methods have become popular in recent years because of their ability to solve complex tasks with minimal feedback. Both genetic algorithms (GAs) and te...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
ECCV
2008
Springer
15 years 6 months ago
Event Modeling and Recognition Using Markov Logic Networks
Abstract. We address the problem of visual event recognition in surveillance where noise and missing observations are serious problems. Common sense domain knowledge is exploited t...
Son Dinh Tran, Larry S. Davis
ACL
2006
15 years 6 months ago
Factoring Synchronous Grammars by Sorting
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Daniel Gildea, Giorgio Satta, Hao Zhang