Sciweavers

903 search results - page 155 / 181
» Non-well-founded trees in categories
Sort
View
106
Voted
CIKM
2005
Springer
15 years 7 months ago
Towards an approach for knowledge-based road detection
Our previous work on road detection suggests the usage of prior knowledge in order to improve performance. In this paper we will explain our motivation for a novel approach, defin...
Mike Foedisch, Craig Schlenoff, Michael Shneier
174
Voted
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
15 years 7 months ago
Discovering biological motifs with genetic programming
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
Rolv Seehuus, Amund Tveit, Ole Edsberg
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
15 years 7 months ago
An evolutionary algorithm to generate hyper-ellipsoid detectors for negative selection
This paper introduces hyper-ellipsoids as an improvement to hyper-spheres as intrusion detectors in a negative selection problem within an artificial immune system. Since hyper-s...
Joseph M. Shapiro, Gary B. Lamont, Gilbert L. Pete...
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 7 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
104
Voted
NOSSDAV
2005
Springer
15 years 7 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...