Sciweavers

17789 search results - page 155 / 3558
» Exceptional Use Cases
Sort
View
121
Voted
PODC
2009
ACM
16 years 4 months ago
Preventing versus curing: avoiding conflicts in transactional memories
Transactional memories are typically speculative and rely on contention managers to cure conflicts. This paper explores a complementary approach that prevents conflicts by schedul...
Aleksandar Dragojevic, Rachid Guerraoui, Anmol V. ...
152
Voted
ECRTS
2007
IEEE
15 years 10 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher
108
Voted
TSD
1999
Springer
15 years 8 months ago
Prague Dependency Treebank: Restoration of Deletions
The use of the treebank as a resource for linguistic research has led us to look for an annotation scheme representing not only surface syntactic information (in ‘analytic treesâ...
Eva Hajicová, Ivana Kruijff-Korbayová...
116
Voted
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
15 years 7 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
143
Voted
FPGA
2006
ACM
113views FPGA» more  FPGA 2006»
15 years 7 months ago
Optimality study of logic synthesis for LUT-based FPGAs
Abstract--Field-programmable gate-array (FPGA) logic synthesis and technology mapping have been studied extensively over the past 15 years. However, progress within the last few ye...
Jason Cong, Kirill Minkovich