Sciweavers

1651 search results - page 204 / 331
» Measuring the Complexity of Classification Problems
Sort
View
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 7 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
AIPS
2008
15 years 4 months ago
From One to Many: Planning for Loosely Coupled Multi-Agent Systems
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
Ronen I. Brafman, Carmel Domshlak
113
Voted
NIPS
2008
15 years 3 months ago
High-dimensional support union recovery in multivariate regression
We study the behavior of block 1/ 2 regularization for multivariate regression, where a K-dimensional response vector is regressed upon a fixed set of p covariates. The problem of...
Guillaume Obozinski, Martin J. Wainwright, Michael...
158
Voted
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
15 years 8 months ago
Speeding-up Rao-blackwellized SLAM
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
140
Voted
BMCBI
2006
201views more  BMCBI 2006»
15 years 2 months ago
Gene selection algorithms for microarray data based on least squares support vector machine
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao