Sciweavers

693 search results - page 22 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
WWW
2005
ACM
16 years 2 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
SLS
2007
Springer
111views Algorithms» more  SLS 2007»
15 years 8 months ago
Mixed Models for the Analysis of Local Search Components
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Jørgen Bang-Jensen, Marco Chiarandini, Yuri...
CIKM
2008
Springer
15 years 3 months ago
Scalable complex pattern search in sequential data
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
Leila Kaghazian, Dennis McLeod, Reza Sadri
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
15 years 7 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
ICPR
2008
IEEE
15 years 8 months ago
A new method to obtain the shift-table in Boyer-Moore's string matching algorithm
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
Yang Wang