1279 search results - page 174 / 256 » Fast Implementations of Automata Computations |
DAC
1999
ACM
14 years 2 months ago
1999
ACM
This paper presents a novel approach for synthesis of analog systems from behavioral VHDL-AMS specifications. We implemented this approach in the VASE behavioral-synthesis tool. ...
HPDC
1998
IEEE
14 years 1 months ago
1998
IEEE
In this paper we present a model for dynamically scheduling HTTP requests across clusters of servers, optimizing the use of client resources as well as the scattered server nodes....
AINTEC
2007
Springer
14 years 1 months ago
2007
Springer
Relative to the impressive number of proposals addressing the multitude of challenges raised by IEEE 802.11-based wireless networks, few have known real implementation. In wireless...
NSDI
2010
13 years 11 months ago
2010
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 ...
SAC
2002
ACM
13 years 9 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...