Sciweavers

2110 search results - page 400 / 422
» What is the complexity of a distributed computing system
Sort
View
KES
1999
Springer
15 years 8 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
ATAL
2008
Springer
15 years 6 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
ECCV
2006
Springer
16 years 6 months ago
Inter-modality Face Recognition
Recently, the wide deployment of practical face recognition systems gives rise to the emergence of the inter-modality face recognition problem. In this problem, the face images in ...
Dahua Lin, Xiaoou Tang
WWW
2009
ACM
16 years 4 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
WWW
2008
ACM
16 years 4 months ago
Restful web services vs. "big"' web services: making the right architectural decision
Recent technology trends in the Web Services (WS) domain indicate that a solution eliminating the presumed complexity of the WS-* standards may be in sight: advocates of REpresent...
Cesare Pautasso, Olaf Zimmermann, Frank Leymann