Sciweavers

36 search results - page 2 / 8
» Consensus When All Processes May Be Byzantine for Some Time
Sort
View
OPODIS
2004
13 years 7 months ago
Optimal Resilience Asynchronous Approximate Agreement
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Ittai Abraham, Yonatan Amit, Danny Dolev
IPPS
2007
IEEE
14 years 20 days ago
Expected Time for Obtaining Dependable Data in Real-Time Environment
In real-time environment, data usually has a lifespan associated with it. The semantics and the importance of the data depend on the time when data is utilized. Hence, the process...
Yue Yu, Shangping Ren
DEDS
2010
88views more  DEDS 2010»
13 years 6 months ago
Optimal Admission Control of Discrete Event Systems with Real-Time Constraints
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
Jianfeng Mao, Christos G. Cassandras
BIOSYSTEMS
2007
123views more  BIOSYSTEMS 2007»
13 years 6 months ago
Real time computation: Zooming in on population codes
Information processing in nervous systems intricately combines computation at the neuronal and network levels. Many computations may be envisioned as sequences of signal processin...
Olivier Rochel, Netta Cohen
IJCAI
1989
13 years 7 months ago
Input Data Management in Real-Time AI Systems
A real-time AI system in the real world needs to monitor an immense volume of data. To do this, the system must filter out much of the incoming data. However, it must remain re­ ...
Richard Washington, Barbara Hayes-Roth