2089 search results - page 234 / 418 » A New Problem in String Searching |
147
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. This paper introduces a new technique called adaptive elitistpopulation search method for allowing unimodal function optimization methods to be extended to efficiently lo...
130
click to vote
CPAIOR
2010
Springer
15 years 8 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
146
click to vote
ICDCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
116
click to vote
IJCAI
2003
15 years 4 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
105
click to vote
NIPS
1997
15 years 4 months ago
1997
We present a new approach to reinforcement learning in which the policies considered by the learning process are constrained by hierarchies of partially specified machines. This ...