Sciweavers

2516 search results - page 2 / 504
» When is there a representer theorem
Sort
View
CCA
2000
Springer
13 years 9 months ago
A Computable Spectral Theorem
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
Martin Ziegler, Vasco Brattka
CSL
2010
Springer
13 years 6 months ago
Exact Exploration and Hanging Algorithms
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
Andreas Blass, Nachum Dershowitz, Yuri Gurevich
ECAI
2000
Springer
13 years 9 months ago
Iterated Revision by Epistemic States: Axioms, Semantics and Syntax
Abstract. We propose a very general syntactical notion of epistemic state and a compact axiomatization for iterated revision when the new information is an epistemic state. We set ...
Salem Benferhat, Sébastien Konieczny, Odile...
MSS
2008
IEEE
80views Hardware» more  MSS 2008»
13 years 5 months ago
Utility representation of lower separable preferences
Topological separability is crucial for the utility representation of a complete preference relation. When preferences are incomplete, this axiom has suitably de...ned counterpart...
Özgür Yilmaz
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
13 years 12 months ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai