Sciweavers

206 search results - page 16 / 42
» A Taxonomy of Cooperative Search Algorithms
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Using appraisal groups for sentiment analysis
Little work to date in sentiment analysis (classifying texts by ‘positive’ or ‘negative’ orientation) has attempted to use fine-grained semantic distinctions in features ...
Casey Whitelaw, Navendu Garg, Shlomo Argamon
ATAL
2010
Springer
13 years 9 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
BIOADIT
2006
Springer
14 years 14 days ago
Proposal and Evaluation of a Cooperative Mechanism for Pure P2P File Sharing Networks
To provide application-oriented network services, a variety of overlay networks are deployed over physical IP networks. Since they share and compete for the same physical network r...
Junjiro Konishi, Naoki Wakamiya, Masayuki Murata
ICASSP
2011
IEEE
13 years 14 days ago
Bio-inspired cooperative optimization with application to bacteria motility
Inspired by bacterial motility, we propose an algorithm for adaptation over networks with mobile nodes. The nodes have limited abilities and they are allowed to cooperate with the...
Jianshu Chen, Ali H. Sayed
IAT
2007
IEEE
14 years 3 months ago
CompAPO: A Complete Version 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