Sciweavers

21 search results - page 4 / 5
» A Tighter Analysis of Work Stealing
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 5 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
ISPD
2005
ACM
140views Hardware» more  ISPD 2005»
13 years 11 months ago
Are floorplan representations important in digital design?
Research in floorplanning and block-packing has generated a variety of data structures to represent spatial configurations of circuit modules. Much of this work focuses on the g...
Hayward H. Chan, Saurabh N. Adya, Igor L. Markov
TMC
2010
109views more  TMC 2010»
13 years 3 months ago
On the Performance Bounds of Practical Wireless Network Coding
—Network coding is an attracting technology that has been shown to be able to improve the throughput of wireless networks. However, there still lacks fundamental understanding on...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
PODC
2009
ACM
14 years 5 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 5 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...