Sciweavers

1596 search results - page 62 / 320
» Human-Guided Simple Search
Sort
View
163
Voted
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 8 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
IQ
2007
15 years 5 months ago
In Search Of An Accuracy Metric
Practitioners and researchers often refer to error rates or accuracy percentages of databases. The former is the number of cells in error divided by the total number of cells; the...
Craig W. Fisher, Eitel J. M. Lauría, Caroly...
132
Voted
CEC
2005
IEEE
15 years 9 months ago
On improving genetic programming for symbolic regression
This paper reports an improvement to genetic programming (GP) search for the symbolic regression domain, based on an analysis of dissimilarity and mating. GP search is generally di...
Steven Gustafson, Edmund K. Burke, Natalio Krasnog...
127
Voted
IBERAMIA
2004
Springer
15 years 9 months ago
Constrainedness and Redundancy by Constraint Ordering
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
Miguel A. Salido, Federico Barber
ECAI
2010
Springer
15 years 5 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave