Sciweavers

1193 search results - page 97 / 239
» A primer of simple theories
Sort
View
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 7 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
POPL
2010
ACM
15 years 6 months ago
Nested interpolants
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
Matthias Heizmann, Jochen Hoenicke, Andreas Podels...
ALIFE
2008
15 years 6 months ago
Natural Selection in Relation to Complexity
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...
Stanley N. Salthe
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 6 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
AIR
2006
107views more  AIR 2006»
15 years 6 months ago
Just enough learning (of association rules): the TAR2 "Treatment" learner
Abstract. An over-zealous machine learner can automatically generate large, intricate, theories which can be hard to understand. However, such intricate learning is not necessary i...
Tim Menzies, Ying Hu