Sciweavers

6976 search results - page 227 / 1396
» The Oil Searching Problem
Sort
View
PRICAI
2000
Springer
15 years 10 months ago
Towards a Next-Generation Search Engine
As more information becomes available on the World Wide Web, it has become an acute problem to provide effective search tools for information access. Previous generations of search...
Qiang Yang, Hai-Feng Wang, Ji-Rong Wen, Gao Zhang,...
AI
2008
Springer
15 years 6 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
FOCS
2004
IEEE
15 years 10 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
MOBICOM
2004
ACM
16 years 15 hour ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
15 years 10 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson