Sciweavers

1859 search results - page 269 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
163
Voted
TSP
2010
14 years 11 months ago
Multichannel fast QR-decomposition algorithms: weight extraction method and its applications
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
Mobien Shoaib, Stefan Werner, José Antonio ...
MLDM
2007
Springer
15 years 11 months ago
Ensemble-based Feature Selection Criteria
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...
Terry Windeatt, Matthew Prior, Niv Effron, Nathan ...
IPTPS
2003
Springer
15 years 10 months ago
Adaptive Peer Selection
In a peer-to-peer file-sharing system, a client desiring a particular file must choose a source from which to download. The problem of selecting a good data source is difficult...
Daniel S. Bernstein, Zhengzhu Feng, Brian Neil Lev...
AIPS
2009
15 years 6 months ago
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
While several powerful domain-independent planners have recently been developed, no one of these clearly outperforms all the others in every known benchmark domain. We present PbP...
Alfonso Gerevini, Alessandro Saetti, Mauro Vallati
ML
2007
ACM
106views Machine Learning» more  ML 2007»
15 years 4 months ago
Surrogate maximization/minimization algorithms and extensions
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung