Sciweavers

227 search results - page 18 / 46
» An investigation of hyper-heuristic search spaces
Sort
View
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
14 years 1 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
AMAI
2004
Springer
14 years 3 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
IDEAS
2003
IEEE
131views Database» more  IDEAS 2003»
14 years 3 months ago
Neighborhood Signatures for Searching P2P Networks
Overlay networks have received a lot of attention due to the recent wide-spread use of peer-to-peer (P2P) applications such as SETI, Napster, Gnutella, and Morpheus. Through repli...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
14 years 4 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
14 years 2 months ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou