811 search results - page 153 / 163 » When Novelty Is Not Enough |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract: A Mobile Adhoc Network (manet) is a cooperative engagement of a collection of mobile nodes without any centralized access point. The underlying concept of coordination am...
AI
2006
Springer
13 years 8 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
ALMOB
2006
13 years 8 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
BMCBI
2006
13 years 8 months ago
2006
Background: Feature selection is an approach to overcome the 'curse of dimensionality' in complex researches like disease classification using microarrays. Statistical m...