Sciweavers

1971 search results - page 134 / 395
» Tabu search - Uncharted domains
Sort
View
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
16 years 23 days ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
DAC
1994
ACM
15 years 10 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
CIKM
2006
Springer
15 years 10 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
FLAIRS
2007
15 years 8 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace
IADIS
2003
15 years 7 months ago
Query Formulation in Web Information Search
Query formulation is an essential part of successful information retrieval. The challenges in formulating effective queries are emphasized in web information search, because the w...
Anne Aula