693 search results - page 77 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
SSWMC
2004
13 years 9 months ago
2004
Steganalysis in the wide sense consists of first identifying suspicious objects and then further analysis during which we try to identify the steganographic scheme used for embedd...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their ...
CLEF
2009
Springer
13 years 9 months ago
2009
Springer
In this paper we will briefly describe the approaches taken by the Berkeley Cheshire Group for the GikiCLEF task of the QA track. Because the task was intended to model some aspec...
SEBD
1997
13 years 9 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...