Sciweavers

4860 search results - page 474 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 4 months ago
A bayesian mixture model with linear regression mixing proportions
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
Xiuyao Song, Chris Jermaine, Sanjay Ranka, John Gu...
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
16 years 4 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
GECCO
2009
Springer
104views Optimization» more  GECCO 2009»
15 years 10 months ago
Sustaining diversity using behavioral information distance
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor pre...
Faustino J. Gomez
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
15 years 10 months ago
Approximate covariance estimation in graphical approaches to SLAM
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
Gian Diego Tipaldi, Giorgio Grisetti, Wolfram Burg...
GECCO
2007
Springer
262views Optimization» more  GECCO 2007»
15 years 10 months ago
Geometric particle swarm optimization for the sudoku puzzle
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
Alberto Moraglio, Julian Togelius