2905 search results - page 126 / 581 » Formal Memetic Algorithms |
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
To investigate the problem of entity recognition, we deal with the creation of the so-called Entity Name System (ENS) which is an open, public back-bone infrastructure for the (Sem...
BMEI
2008
IEEE
15 years 4 months ago
2008
IEEE
Standard Gene Expression Programming(GEP) works with fixed rate of mutation and crossover, ignoring the variation of the individual fitness, hence it works in the local optimum st...
LICS
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
ACSC
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...