Sciweavers

553 search results - page 70 / 111
» A General Theory of Additive State Space Abstractions
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 18 days ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
COMPGEOM
2009
ACM
14 years 3 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
MIAR
2010
IEEE
13 years 7 months ago
A Framework for 3D Analysis of Facial Morphology in Fetal Alcohol Syndrome
Abstract. Surface-based morphometry (SBM) is widely used in biomedical imaging and other domains to localize shape changes related to different conditions. This paper presents a co...
Jing Wan, Li Shen, Shiaofen Fang, Jason McLaughlin...
LPNMR
1990
Springer
14 years 23 days ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
CPC
2006
110views more  CPC 2006»
13 years 8 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin