Sciweavers

3223 search results - page 395 / 645
» The Scaling of Search Cost
Sort
View
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
15 years 6 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman
AMAI
2005
Springer
15 years 6 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
TPDS
2008
88views more  TPDS 2008»
15 years 6 months ago
A Two-Hop Solution to Solving Topology Mismatch
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
Yunhao Liu
AAMAS
2004
Springer
15 years 6 months ago
Multi-Dimensional, MultiStep Negotiation
We present a multi-dimensional, multi-step negotiation mechanism for task allocation among cooperative agents based on distributed search. This mechanism uses marginal utility gai...
Xiaoqin Zhang, Victor R. Lesser, Rodion M. Podoroz...
CORR
1999
Springer
116views Education» more  CORR 1999»
15 years 6 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...