Sciweavers

1302 search results - page 226 / 261
» Fair Equivalence Relations
Sort
View
DC
2010
13 years 7 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 7 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
13 years 7 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
DSS
2007
226views more  DSS 2007»
13 years 7 months ago
Dare to share: Protecting sensitive knowledge with data sanitization
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Ali Amiri
OSN
2008
88views more  OSN 2008»
13 years 7 months ago
Grade-of-service differentiated static resource allocation schemes in WDM networks
This paper presents a study on the Grade-of-Service (GoS) differentiation of static resource allocation in lightpath routed WDM networks, where lightpath requests between node pai...
James Yiming Zhang, Jing Wu, Gregor von Bochmann, ...