Sciweavers

805 search results - page 140 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
ACML
2009
Springer
15 years 4 months ago
Linear Time Model Selection for Mixture of Heterogeneous Components
Abstract: Our main contribution is to propose a novel model selection methodology, expectation minimization of information criterion (EMIC). EMIC makes a significant impact on the...
Ryohei Fujimaki, Satoshi Morinaga, Michinari Momma...
ICCV
2005
IEEE
15 years 3 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
15 years 4 months ago
Learning What Makes a Society Tick
We present a machine learning methodology (models, algorithms, and experimental data) to discovering the agent dynamics that drive the evolution of the social groups in a communit...
Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Is...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 3 months ago
Isolating the benefits of respect
The three mechanisms of crossover are transmission, assortment, and respect. Of these three mechanisms, assortment (i.e. recombination) is traditionally viewed as the primary feat...
Stephen Chen, Gregory Pitt
CEC
2010
IEEE
14 years 11 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius