Sciweavers

2740 search results - page 53 / 548
» Approximating Component Selection
Sort
View
MST
2006
149views more  MST 2006»
14 years 9 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
ROBIO
2006
IEEE
129views Robotics» more  ROBIO 2006»
15 years 3 months ago
Learning Utility Surfaces for Movement Selection
— Humanoid robots are highly redundant systems with respect to the tasks they are asked to perform. This redundancy manifests itself in the number of degrees of freedom of the ro...
Matthew Howard, Michael Gienger, Christian Goerick...
ATAL
2008
Springer
14 years 12 months ago
Selecting strategies using empirical game models: an experimental analysis of meta-strategies
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
Christopher Kiekintveld, Michael P. Wellman
EUSFLAT
2009
158views Fuzzy Logic» more  EUSFLAT 2009»
14 years 7 months ago
Bi-criteria Genetic Selection of Bagging Fuzzy Rule-based Multiclassification Systems
Previously we proposed a scheme to generate fuzzy rule-based multiclassification systems by means of bagging, mutual information-based feature selection, and a multicriteria geneti...
Krzysztof Trawinski, Arnaud Quirin, Oscar Cord&oac...
NIPS
2008
14 years 11 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas