Sciweavers

2485 search results - page 55 / 497
» Time Bounded Frequency Computations
Sort
View
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
14 years 2 days ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh
FOCS
2005
IEEE
14 years 3 months ago
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
This paper proves   ¡ £ ¥ lower bounds on the time to perform a single instance of an operation in any implementation of a large class of data structures shared by £ processe...
Faith Ellen Fich, Danny Hendler, Nir Shavit
ET
2002
97views more  ET 2002»
13 years 10 months ago
Test Generation for Crosstalk-Induced Faults: Framework and Computational Results
Due to technology scaling and increasing clock frequency, problems due to noise effects lead to an increase in design/debugging efforts and a decrease in circuit performance. This...
Wei-Yu Chen, Sandeep K. Gupta, Melvin A. Breuer
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
APN
2006
Springer
14 years 1 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard