Sciweavers

282 search results - page 10 / 57
» Comparison of Different Methods for Next Location Prediction
Sort
View
ICDM
2008
IEEE
102views Data Mining» more  ICDM 2008»
14 years 3 months ago
A Non-parametric Semi-supervised Discretization Method
Semi-supervised classification methods aim to exploit labelled and unlabelled examples to train a predictive model. Most of these approaches make assumptions on the distribution ...
Alexis Bondu, Marc Boullé, Vincent Lemaire,...
HPDC
2006
IEEE
14 years 2 months ago
Effective Prediction of Job Processing Times in a Large-Scale Grid Environment
Grid applications that use a considerable number of processors for their computations need effective predictions of the expected computation times on the different nodes. Currentl...
Menno Dobber, Robert D. van der Mei, Ger Koole
IWPSE
2007
IEEE
14 years 3 months ago
Improving defect prediction using temporal features and non linear models
Predicting the defects in the next release of a large software system is a very valuable asset for the project manger to plan her resources. In this paper we argue that temporal f...
Abraham Bernstein, Jayalath Ekanayake, Martin Pinz...
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
14 years 14 days ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
ECCV
2002
Springer
14 years 10 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel