Sciweavers

520 search results - page 66 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...
PDP
2002
IEEE
14 years 1 months ago
The Iso-Level Scheduling Heuristic for Heterogeneous Processors
Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature,...
Olivier Beaumont, Vincent Boudet, Yves Robert
CN
2004
85views more  CN 2004»
13 years 8 months ago
The multicast address allocation problem: theory and practice
Abstract-- In this paper, we perform the first comprehensive study of the multicast address allocation problem. We analyze this problem both within its context as a classic resourc...
Daniel Zappala, Virginia Mary Lo, Chris GauthierDi...
PPSN
2010
Springer
13 years 6 months ago
Globally Induced Model Trees: An Evolutionary Approach
In the paper we propose a new evolutionary algorithm for induction of univariate regression trees that associate leaves with simple linear regression models. In contrast to typical...
Marcin Czajkowski, Marek Kretowski
IEEEHPCS
2010
13 years 6 months ago
Fast learning for multibiometrics systems using genetic algorithms
The performance (in term of error rate) of biometric systems can be improved by combining them. Multiple fusion techniques can be applied from classical logical operations to more...
Romain Giot, Mohamad El-Abed, Christophe Rosenberg...