Sciweavers

19866 search results - page 283 / 3974
» Computing all factorizations in ***
Sort
View
ICSE
2004
IEEE-ACM
16 years 6 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
ISTCS
1992
Springer
15 years 10 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
13 years 9 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li
CHI
2008
ACM
16 years 7 months ago
LivOlay: interactive ad-hoc registration and overlapping of applications for collaborative visual exploration
The interoperability of disparate data types and sources has been a long standing problem and a hindering factor for the efficacy and efficiency in visual exploration applications...
Hao Jiang, Daniel Wigdor, Clifton Forlines, Michel...
FOCS
2009
IEEE
16 years 1 months ago
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna