Sciweavers

147 search results - page 21 / 30
» Describing Problem Solving Methods using Anytime Performance...
Sort
View
214
Voted
IWCLS
2007
Springer
15 years 10 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
188
Voted
WIDM
2004
ACM
15 years 10 months ago
Probabilistic models for focused web crawling
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
Hongyu Liu, Evangelos E. Milios, Jeannette Janssen
122
Voted
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 5 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
GECCO
2010
Springer
183views Optimization» more  GECCO 2010»
15 years 9 months ago
Neuroevolution of mobile ad hoc networks
This paper describes a study of the evolution of distributed behavior, specifically the control of agents in a mobile ad hoc network, using neuroevolution. In neuroevolution, a p...
David B. Knoester, Heather Goldsby, Philip K. McKi...
JAIR
2006
157views more  JAIR 2006»
15 years 4 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...