Sciweavers

206 search results - page 23 / 42
» A Taxonomy of Cooperative Search Algorithms
Sort
View
ICAIL
2005
ACM
14 years 1 months ago
Effective Document Clustering for Large Heterogeneous Law Firm Collections
Computational resources for research in legal environments have historically implied remote access to large databases of legal documents such as case law, statutes, law reviews an...
Jack G. Conrad, Khalid Al-Kofahi, Ying Zhao, Georg...
JAIR
2008
110views more  JAIR 2008»
13 years 7 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
CHI
2005
ACM
14 years 8 months ago
Interactive search in large video collections
We present a search interface for large video collections with time-aligned text transcripts. The system is designed for users such as intelligence analysts that need to quickly f...
Andreas Girgensohn, John Adcock, Matthew L. Cooper...
ATAL
2009
Springer
14 years 2 months ago
Searching for fair joint gains in agent-based negotiation
In multi-issue negotiations, autonomous agents can act cooperatively to benefit from mutually preferred agreements. However, empirical evidence suggests that they often fail to s...
Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk
MIDDLEWARE
2005
Springer
14 years 1 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper