Sciweavers

6517 search results - page 60 / 1304
» On optimal service selection
Sort
View
PAMI
2010
185views more  PAMI 2010»
14 years 10 months ago
Evaluating Stability and Comparing Output of Feature Selectors that Optimize Feature Subset Cardinality
—Stability (robustness) of feature selection methods is a topic of recent interest, yet often neglected importance, with direct impact on the reliability of machine learning syst...
Petr Somol, Jana Novovicová
INFOCOM
2010
IEEE
14 years 10 months ago
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
Tao Shu, Marwan Krunz
ALT
2004
Springer
15 years 8 months ago
Convergence of a Generalized Gradient Selection Approach for the Decomposition Method
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
Nikolas List
ECOWS
2007
Springer
15 years 6 months ago
QoS-Aware Service Composition in Dino
A major advantage offered by Web services technologies is the ability to dynamically discover and invoke services. This ability is particularly important for operations of many ap...
Arun Mukhija, Andrew Dingwall-Smith, David S. Rose...
GECCO
2008
Springer
119views Optimization» more  GECCO 2008»
15 years 28 days ago
Learning offspring optimizing mate selection
This poster paper presents a methodology for removing userdefined parameters at the parent selection stage, by allowing all individuals in the population to self-organize into pa...
Ekaterina A. Holdener, Daniel R. Tauritz