3352 search results - page 80 / 671 » Hierarchical Problem Solving and the Bayesian Optimization A... |
125
click to vote
SSWMC
2004
15 years 6 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
136
click to vote
ICDM
2009
IEEE
15 years 11 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
155
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
129
Voted
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
Hierarchical clustering methods are important in many data mining and pattern recognition tasks. In this paper we present an efficient coarse grained parallel algorithm for Single...
140
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...