Sciweavers

1477 search results - page 236 / 296
» Random Convex Programs
Sort
View
DAC
2010
ACM
13 years 11 months ago
On the costs and benefits of stochasticity in stream processing
With the end of clock-frequency scaling, parallelism has emerged as the key driver of chip-performance growth. Yet, several factors undermine efficient simultaneous use of onchip ...
Raj R. Nadakuditi, Igor L. Markov
APLAS
2008
ACM
13 years 9 months ago
The Complexity of Coverage
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
Krishnendu Chatterjee, Luca de Alfaro, Rupak Majum...
ICALP
2010
Springer
13 years 9 months ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
ICALP
2010
Springer
13 years 9 months ago
Sparse Reliable Graph Backbones
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David...
ICALP
2010
Springer
13 years 9 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...