Sciweavers

5158 search results - page 160 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
13 years 11 months ago
Deriving evaluation metrics for applicability of genetic algorithms to optimization problems
This paper aims to identify the missing links from theory of Genetic Algorithms (GAs) to application of GAs. Categories and Subject Descriptors: J.0 [Computer Applications]: Gener...
Hsinyi Jiang, Carl K. Chang
AML
2006
49views more  AML 2006»
13 years 10 months ago
No Escape from Vardanyan's theorem
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
Albert Visser, Maartje de Jonge
CSL
2002
Springer
13 years 10 months ago
Designs, Disputes and Strategies
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" apprao...
Claudia Faggian, Martin Hyland
ECCV
2008
Springer
15 years 2 days ago
Unified Frequency Domain Analysis of Lightfield Cameras
Abstract. This paper presents a theory that encompasses both "plenoptic" (microlens based) and "heterodyning" (mask based) cameras in a single frequency-domain ...
Todor Georgiev, Chintan Intwala, Sevkit Babakan, A...
LICS
2003
IEEE
14 years 3 months ago
Structural Subtyping of Non-Recursive Types is Decidable
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
Viktor Kuncak, Martin C. Rinard