Sciweavers

2080 search results - page 253 / 416
» Measuring empirical computational complexity
Sort
View
PDP
2006
IEEE
16 years 13 hour ago
An O(n) Distributed Deadlock Resolution Algorithm
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of prev...
Manuel Prieto, Jesús E. Villadangos, Federi...
SC
2005
ACM
15 years 11 months ago
How Well Can Simple Metrics Represent the Performance of HPC Applications?
In this paper, a systematic study of the effects of complexity of prediction methodology on its accuracy for a set of real applications on a variety of HPC systems is performed. R...
Laura Carrington, Michael Laurenzano, Allan Snavel...
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
15 years 11 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
EGC
2005
Springer
15 years 11 months ago
Tools for Distributed Development and Deployment on the Grid
Abstract. The development and deployment of middleware and applications in a grid environment spread over many institutions is a complex challenge. The management of the developmen...
Ariel García, Markus Hardt, Harald Kornmaye...
VLDB
2005
ACM
114views Database» more  VLDB 2005»
15 years 11 months ago
Checking for k-Anonymity Violation by Views
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
Chao Yao, Xiaoyang Sean Wang, Sushil Jajodia