Sciweavers

922 search results - page 137 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 9 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
EUSFLAT
2001
15 years 7 months ago
Similarity-based unification: a multi-adjoint approach
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming whi...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
CCIA
2009
Springer
15 years 7 months ago
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Pere Pardo, Pilar Dellunde, Lluis Godo
ACTA
2010
81views more  ACTA 2010»
15 years 6 months ago
Lifting non-finite axiomatizability results to extensions of process algebras
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
CAD
2006
Springer
15 years 6 months ago
Fast computation of inertia through affinely extended Euler tensor
We introduce an affine extension of the Euler tensor which encompasses all of the inertia properties of interest in a convenient linear format, and we show how it transforms under...
Antonio DiCarlo, Alberto Paoluzzi