Sciweavers

3136 search results - page 160 / 628
» Genetic programming theory
Sort
View
ICALP
2010
Springer
15 years 4 months ago
Towards a Theory of Time-Bounded Verification
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
Joël Ouaknine, James Worrell
KI
1990
Springer
15 years 8 months ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
15 years 9 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
15 years 10 months ago
Hybrid multiobjective genetic algorithm with a new adaptive local search process
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
Salem F. Adra, Ian Griffin, Peter J. Fleming
POPL
2007
ACM
16 years 4 months ago
From implementation to theory in product synthesis
Future software development will rely on product synthesis, i.e., the synthesis of code and non-code artifacts for a target component or application. Prior work on feature-based p...
Don S. Batory