Sciweavers

267 search results - page 39 / 54
» Robust comparative statics in large static games
Sort
View
NSDI
2010
15 years 7 months ago
Prophecy: Using History for High-Throughput Fault Tolerance
Byzantine fault-tolerant (BFT) replication has enjoyed a series of performance improvements, but remains costly due to its replicated work. We eliminate this cost for read-mostly ...
Siddhartha Sen, Wyatt Lloyd, Michael J. Freedman
JSS
2006
85views more  JSS 2006»
15 years 5 months ago
Effects of context on program slicing
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
Jens Krinke
MICRO
2010
IEEE
149views Hardware» more  MICRO 2010»
15 years 3 months ago
Improving SIMT Efficiency of Global Rendering Algorithms with Architectural Support for Dynamic Micro-Kernels
Wide Single Instruction, Multiple Thread (SIMT) architectures often require a static allocation of thread groups that are executed in lockstep throughout the entire application ker...
Michael Steffen, Joseph Zambreno
KDD
1995
ACM
167views Data Mining» more  KDD 1995»
15 years 9 months ago
Efficient Algorithms for Attribute-Oriented Induction
Data mining or knowledge discovery in databasesis the search for relationships and global patterns that exist but are hidden in large databases.Many different methodshave been pro...
Hoi-Yee Hwang, Ada Wai-Chee Fu
CORR
2010
Springer
150views Education» more  CORR 2010»
15 years 6 months ago
Boosting Multi-Core Reachability Performance with Shared Hash Tables
Abstract--This paper focuses on data structures for multicore reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of a...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...