Sciweavers

1983 search results - page 167 / 397
» Competitive graph searches
Sort
View
CSCLP
2008
Springer
13 years 9 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig
SIGMOD
2010
ACM
212views Database» more  SIGMOD 2010»
13 years 6 months ago
Understanding deep web search interfaces: a survey
This paper presents a survey on the major approaches to search interface understanding. The Deep Web consists of data that exist on the Web but are inaccessible via text search en...
Ritu Khare, Yuan An, Il-Yeol Song
ICDE
2008
IEEE
425views Database» more  ICDE 2008»
15 years 7 months ago
NAGA: Searching and Ranking Knowledge
The Web has the potential to become the world’s largest knowledge base. In order to unleash this potential, the wealth of information available on the Web needs to be extracte...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
ATAL
2006
Springer
13 years 11 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara