4324 search results - page 48 / 865 » A Generalized Representer Theorem |
122
click to vote
EC
2006
15 years 22 days ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
IGPL
2008
15 years 7 days ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
108
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
102
Voted
APAL
2005
15 years 19 days ago
2005
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
101
click to vote
SIAMCOMP
2008
15 years 19 days ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...