METRICS
2002
IEEE
14 years 4 months ago
2002
IEEE
The Center for Empirically Based Software Engineering helps improve software development by providing guidelines for selecting development techniques, recommending areas for furth...
AUSAI
2003
Springer
14 years 5 months ago
2003
Springer
We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find...
IPPS
2003
IEEE
14 years 5 months ago
2003
IEEE
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
INFOCOM
2003
IEEE
14 years 5 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
DSD
2003
IEEE
14 years 5 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
EUROPAR
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. We study in this paper several scheduling heuristics for GridRPC middlewares. When dealing with performance issue, the scheduling strategy is one of the most important fe...
ECML
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. In this paper, we investigate the properties of commonly used prepruning heuristics for rule learning by visualizing them in PN-space. PN-space is a variant of ROC-space,...
ISMIR
2005
Springer
14 years 5 months ago
2005
Springer
Common approaches to creating playlists are to randomly shuffle a collection (e.g. iPod shuffle) or manually select songs. In this paper we present and evaluate heuristics to ad...
GECCO
2005
Springer
14 years 5 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
ICTAI
2006
IEEE
14 years 5 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...