Sciweavers

1912 search results - page 232 / 383
» Don't Compare Averages
Sort
View
SAC
2004
ACM
15 years 7 months ago
An improved hybrid genetic algorithm for the generalized assignment problem
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
Harald Feltl, Günther R. Raidl
SAC
2004
ACM
15 years 7 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
CIA
2004
Springer
15 years 7 months ago
Qualitative Analysis of User-Based and Item-Based Prediction Algorithms for Recommendation Agents
Recommendation agents employ prediction algorithms to provide users with items that match their interests. In this paper, several prediction algorithms are described and evaluated...
Manos Papagelis, Dimitris Plexousakis
139
Voted
DAWAK
2004
Springer
15 years 7 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan
EMSOFT
2004
Springer
15 years 7 months ago
An approach for integrating basic retiming and software pipelining
Basic retiming is an algorithm originally developed for hardware optimization. Software pipelining is a technique proposed to increase instruction-level parallelism for parallel p...
Noureddine Chabini, Wayne Wolf