469 search results - page 1 / 94 » Genetic Programming with Fitness Based on Model Checking |
EUROGP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
FOGA
1994
13 years 5 months ago
1994
An important goal of the theory of genetic algorithms is to build predictive models of how well genetic algorithms are expected to perform, given a representation, a fitness lands...
PPSN
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We introduce, analyze, and experimentally examine co-solvability, an ability of a solution to solve a pair of fitness cases (tests). Based on this concept, we devise a co...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
We present a genetic model based on simulated recombination of fixed sequences of quaternary genes (assuming four distinct forms, or alleles). States and dynamics of the infinite ...
FLAIRS
2008
13 years 6 months ago
2008
Rule extraction is a technique aimed at transforming highly accurate opaque models like neural networks into comprehensible models without losing accuracy. G-REX is a rule extract...