3136 search results - page 186 / 628 » Genetic programming theory |
113
Voted
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
128
Voted
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
138
Voted
JFP
2008
15 years 4 months ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
168
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
355
Voted
SYNASC
2008
IEEE
15 years 11 months ago
2008
IEEE
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a ...