16082 search results - page 397 / 3217 » Fireworks Algorithm for Optimization |
124
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...
120
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
156
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
161
Voted
BMCBI
2008
15 years 5 months ago
2008
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
179
click to vote
TSP
2010
14 years 11 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...