Sciweavers

1226 search results - page 149 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
173
Voted
POPL
1989
ACM
15 years 7 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
ICML
1996
IEEE
16 years 4 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
DAC
2000
ACM
16 years 4 months ago
Formal verification of iterative algorithms in microprocessors
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
Mark Aagaard, Robert B. Jones, Roope Kaivola, Kath...
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 9 months ago
Using group selection to evolve leadership in populations of self-replicating digital organisms
This paper describes a study in the evolution of distributed cooperative behavior, specifically leader election, through digital evolution and group selection. In digital evoluti...
David B. Knoester, Philip K. McKinley, Charles Ofr...
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 9 months ago
Evolutionary computation and the c-value paradox
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
Sean Luke