Sciweavers

375 search results - page 3 / 75
» Making Abstract Machines Less Abstract
Sort
View
SOSP
2007
ACM
14 years 7 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
14 years 25 days ago
Making fast buffer insertion even faster via approximation techniques
Abstract— As technology scales to 0.13 micron and below, designs are requiring buffers to be inserted on interconnects of even moderate length for both critical paths and fixing...
Zhuo Li, Cliff C. N. Sze, Charles J. Alpert, Jiang...
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 9 months ago
Modeling and decision making in spatio-temporal processes for environmental surveillance
Abstract— The need for efficient monitoring of spatiotemporal dynamics in large environmental surveillance applications motivates the use of robotic sensors to achieve sufficie...
Amarjeet Singh 0003, Fabio Ramos, Hugh D. Whyte, W...
IPPS
1997
IEEE
14 years 3 months ago
An Architecture Workbench for Multicomputers
The large design space of modern computer architectures calls for performance modelling tools to facilitate the evaluation of different alternatives. In this paper, we give an ove...
Andy D. Pimentel, Louis O. Hertzberger
CIE
2007
Springer
14 years 5 months ago
The Complexity of Quickly ORM-Decidable Sets
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
Joel David Hamkins, David Linetsky, Russell G. Mil...