Sciweavers

1628 search results - page 130 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
119
Voted
ICARIS
2009
Springer
15 years 7 months ago
Efficient Algorithms for String-Based Negative Selection
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
Michael Elberfeld, Johannes Textor
VRST
1997
ACM
15 years 8 months ago
View volume culling using a probabilistic caching scheme
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
Mel Slater, Yiorgos Chrysanthou
BMCBI
2005
119views more  BMCBI 2005»
15 years 3 months ago
GASH: An improved algorithm for maximizing the number of equivalent residues between two protein structures
Background: We introduce GASH, a new, publicly accessible program for structural alignment and superposition. Alignments are scored by the Number of Equivalent Residues (NER), a q...
Daron M. Standley, Hiroyuki Toh, Haruki Nakamura
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 7 months ago
On evolving buffer overflow attacks using genetic programming
In this work, we employed genetic programming to evolve a "white hat" attacker; that is to say, we evolve variants of an attack with the objective of providing better de...
Hilmi Günes Kayacik, Malcolm I. Heywood, A. N...
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
15 years 7 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding