Sciweavers

3047 search results - page 50 / 610
» Randomized Parallel Selection
Sort
View
ISPA
2004
Springer
14 years 1 months ago
A Scalable Low Discrepancy Point Generator for Parallel Computing
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
Kwong-Ip Liu, Fred J. Hickernell
AAAI
2007
13 years 10 months ago
A Meta-learning Approach for Selecting between Response Automation Strategies in a Help-desk Domain
We present a corpus-based approach for the automation of help-desk responses to users’ email requests. Automation is performed on the basis of the similarity between a request a...
Yuval Marom, Ingrid Zukerman, Nathalie Japkowicz
ISAAC
1994
Springer
80views Algorithms» more  ISAAC 1994»
13 years 11 months ago
Unifying Themes for Network Selection
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
MCS
2007
Springer
14 years 1 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
ICARIS
2005
Springer
14 years 1 months ago
A Comparative Study of Real-Valued Negative Selection to Statistical Anomaly Detection Techniques
The (randomized) real-valued negative selection algorithm is an anomaly detection approach, inspired by the negative selection immune system principle. The algorithm was proposed t...
Thomas Stibor, Jonathan Timmis, Claudia Eckert