15033 search results - page 197 / 3007 » Complexity Theory and Algorithms |
182
click to vote
LOGCOM
2010
14 years 11 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
148
click to vote
IJON
1998
15 years 4 months ago
1998
Bayesian Kullback Ying—Yang dependence reduction system and theory is presented. Via stochastic approximation, implementable algorithms and criteria are given for parameter lear...
130
click to vote
ECCC
2007
15 years 4 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
129
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
184
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...