Sciweavers

1461 search results - page 32 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
FLAIRS
2004
15 years 1 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
AI
2008
Springer
14 years 12 months ago
Managing parallel inquiries in agents' two-sided search
In this paper we address the problem of agents engaged in a distributed costly two-sided search for pairwise partnerships in Multi-Agent Systems (MAS). While traditional two-sided...
David Sarne, Sarit Kraus
CIKM
2009
Springer
15 years 6 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
CP
1997
Springer
15 years 4 months ago
Heavy-Tailed Distributions in Combinatorial Search
Abstract. Combinatorial search methods often exhibit a large variability in performance. We study the cost pro les of combinatorial search procedures. Our study reveals some intrig...
Carla P. Gomes, Bart Selman, Nuno Crato
TC
2010
14 years 10 months ago
TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections
—Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy. Prec...
Hanhua Chen, Jun Yan, Hai Jin, Yunhao Liu, Lionel ...