4469 search results - page 284 / 894 » Comparing and Combining Profiles |
160
Voted
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
140
click to vote
DAWAK
2005
Springer
15 years 10 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
142
click to vote
ICNC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
134
click to vote
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
138
Voted
ICA
2004
Springer
15 years 10 months ago
2004
Springer
Blind source separation, which supposes that the sources are independent, is a well known domain in signal processing. However, in a noisy environment the estimation of the criteri...