Sciweavers

4553 search results - page 674 / 911
» Distributed Ranked Search
Sort
View
JAIR
2008
110views more  JAIR 2008»
15 years 3 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
153
Voted
NETWORKS
2008
15 years 3 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
148
Voted
AI
2005
Springer
15 years 3 months ago
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
Richard J. Wallace, Eugene C. Freuder
127
Voted
AMAI
2005
Springer
15 years 3 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
121
Voted
TPDS
2008
88views more  TPDS 2008»
15 years 3 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