Sciweavers

17541 search results - page 3464 / 3509
» Complexity in scalable computing
Sort
View
CORR
2008
Springer
170views Education» more  CORR 2008»
14 years 9 months ago
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
Sudhir Kumar Singh, Vwani P. Roychowdhury
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 9 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CPHYSICS
2010
184views more  CPHYSICS 2010»
14 years 9 months ago
Parallel Newton-Krylov-Schwarz algorithms for the three-dimensional Poisson-Boltzmann equation in numerical simulation of colloi
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
Feng-Nan Hwang, Shang-Rong Cai, Yun-Long Shao, Jon...
CORR
2008
Springer
132views Education» more  CORR 2008»
14 years 9 months ago
Dynamic Rate Allocation in Fading Multiple-access Channels
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
DC
2010
14 years 9 months ago
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
Rachid Guerraoui, Marko Vukolic
« Prev « First page 3464 / 3509 Last » Next »