Sciweavers

4198 search results - page 79 / 840
» In search of lost time
Sort
View
JGO
2010
89views more  JGO 2010»
15 years 4 months ago
Stopping rules in k-adaptive global random search algorithms
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Anatoly A. Zhigljavsky, Emily Hamilton
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 6 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
SSDBM
2002
IEEE
100views Database» more  SSDBM 2002»
15 years 10 months ago
Similarity Searching for Multi-Attribute Sequences
We investigate the problem of searching similar multiattribute time sequences. Such sequences arise naturally in a number of medical, financial, video, weather forecast, and stoc...
Tamer Kahveci, Ambuj K. Singh, Aliekber Gürel
TIME
2005
IEEE
15 years 11 months ago
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
Artie Basukoski, Alexander Bolotov
IJCAI
2003
15 years 7 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf