Sciweavers

15033 search results - page 57 / 3007
» Complexity Theory and Algorithms
Sort
View
99
Voted
SYNTHESE
2011
87views more  SYNTHESE 2011»
14 years 10 months ago
Information theory, evolutionary computation, and Dembski's "complex specified information"
Wesley R. Elsberry, Jeffrey Shallit
AAAI
1993
15 years 4 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
FSTTCS
1994
Springer
15 years 7 months ago
My Favorite Ten Complexity Theorems of the Past Decade
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
Lance Fortnow
EUROCRYPT
2012
Springer
13 years 5 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
116
Voted
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 9 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett