3513 search results - page 295 / 703 » Super Logic Programs |
129
click to vote
GECCO
1999
Springer
15 years 8 months ago
1999
Springer
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
133
click to vote
AAAI
2008
15 years 6 months ago
2008
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
154
Voted
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
110
click to vote
CAV
2006
Springer
15 years 7 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
129
click to vote
EUROGP
2008
Springer
15 years 5 months ago
2008
Springer
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...