Sciweavers

371 search results - page 35 / 75
» Partition Theorems and Computability Theory
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 1 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
RSKT
2010
Springer
14 years 8 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou
CSL
2009
Springer
15 years 4 months ago
Enriching an Effect Calculus with Linear Types
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
Jeff Egger, Rasmus Ejlers Møgelberg, Alex S...
LICS
2006
IEEE
15 years 3 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
SIAMAM
2002
129views more  SIAMAM 2002»
14 years 9 months ago
Periodic Wavelet Transforms and Periodicity Detection
The theory of periodic wavelet transforms presented here was originally developed to deal with the problem of epileptic seizure prediction. A central theorem in the theory is the c...
Götz E. Pfander, John J. Benedetto