Sciweavers

5158 search results - page 152 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
14 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
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
13 years 12 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli
IWFM
1998
13 years 11 months ago
Motivation for a New Semantics for Vagueness
Vagueness is the phenomenon that natural language predicates have borderline regions of applicability and that the boundaries of the borderline region are not determinable. A theo...
Mark Changizi
ENTCS
2008
79views more  ENTCS 2008»
13 years 10 months ago
Tensors of Comodels and Models for Operational Semantics
In seeking a unified study of computational effects, in particular in order to give a general operational semantics agreeing with the standard one for state, one must take account...
Gordon D. Plotkin, John Power
ENTCS
2006
101views more  ENTCS 2006»
13 years 10 months ago
Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...
Isar Stubbe