42230 search results - page 351 / 8446 » Algorithms and Complexity Results for |
191
click to vote
SIGAL
1990
15 years 10 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
165
click to vote
SSWMC
2004
15 years 8 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...
184
click to vote
WAIM
2010
Springer
15 years 4 months ago
2010
Springer
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
160
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) n...
174
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
Optimization of the control parameters of genetic algorithms is often a time consuming and tedious task. In this work we take the meta-level genetic algorithm approach to control ...