2913 search results - page 509 / 583 » How Much to Copy |
POPL
2010
ACM
14 years 6 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
EUROSYS
2010
ACM
14 years 6 months ago
2010
ACM
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...
ICCAD
2006
IEEE
14 years 6 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
ICCAD
2001
IEEE
14 years 6 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
CSCW
2010
ACM
14 years 5 months ago
2010
ACM
In a world of widespread information access, information can overwhelm collaborators, even with visualizations to help. We extend prior work to study the effect of shared informat...