7988 search results - page 438 / 1598 » A Useful Undecidable Theory |
169
click to vote
ISMVL
2007
IEEE
16 years 1 months ago
2007
IEEE
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
156
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
156
click to vote
GECCO
2005
Springer
16 years 12 days ago
2005
Springer
Several researchers have used Price’s equation (from biology theory literature) to analyze the various components of an Evolutionary Algorithm (EA) while it is running, giving i...
159
click to vote
TPHOL
2003
IEEE
16 years 4 days ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
192
click to vote
AE
2003
Springer
16 years 3 days ago
2003
Springer
The aim of this research is to develop an adaptive agent based model of auction scenarios commonly used in auction theory to help understand how competitors in auctions reach equil...