Sciweavers

944 search results - page 61 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
107
Voted
DEXA
2010
Springer
187views Database» more  DEXA 2010»
14 years 8 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
74
Voted
ISCAS
2005
IEEE
133views Hardware» more  ISCAS 2005»
15 years 3 months ago
Multiobjective VLSI cell placement using distributed simulated evolution algorithm
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Sadiq M. Sait, Ali Mustafa Zaidi, Mustafa I. Ali
77
Voted
VLDB
1999
ACM
87views Database» more  VLDB 1999»
15 years 2 months ago
Query Optimization for XML
XML is an emerging standard for data representation and exchange on the World-Wide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect...
Jason McHugh, Jennifer Widom
PPL
2010
117views more  PPL 2010»
14 years 5 months ago
Neighborhood Structures for GPU-Based Local Search Algorithms
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
94
Voted
SIGIR
2008
ACM
14 years 8 months ago
ResIn: a combination of results caching and index pruning for high-performance web search engines
Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit...
Gleb Skobeltsyn, Flavio Junqueira, Vassilis Placho...