2089 search results - page 74 / 418 » A New Problem in String Searching |
193
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
213
click to vote
ICMLA
2004
15 years 7 months ago
2004
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
130
click to vote
ICGA
1997
15 years 7 months ago
1997
This paper introduces the wave model, a novel approach on analyzing the behavior of GAs. Our aim is to give techniques that have practical relevance and provide tools for improvin...
169
click to vote
IPPS
2007
IEEE
16 years 14 days ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
147
click to vote
ANOR
2011
15 years 1 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...