Sciweavers

4229 search results - page 245 / 846
» On the Optimality of Spiral Search
Sort
View
FAST
2004
15 years 3 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
PSB
2003
15 years 3 months ago
MAP: Searching Large Genome Databases
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Tamer Kahveci, Ambuj K. Singh
AAAI
2000
15 years 3 months ago
Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...
AAAI
1998
15 years 3 months ago
An Integer Local Search Method with Application to Capacitated Production Planning
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
Joachim P. Walser, Ramesh Iyer, Narayan Venkatasub...
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
15 years 2 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount