Sciweavers

3602 search results - page 77 / 721
» Isn't It About Time
Sort
View
WER
2010
Springer
13 years 5 months ago
From User Requirements to Tasks Descriptions in Real-Time Systems
Real-time scheduling theory has made a great progress in the last decades. From small devices to enormous satellites or industrial plants take advantage of this ongoing research. H...
Leo Ordínez, David Donari, Rodrigo M. Santo...
WSC
2004
13 years 9 months ago
Exploiting Temporal Uncertainty in Process-Oriented Distributed Simulations
Existing research has defined a new type of simulation time called Approximate Time, where the simulation's knowledge about the values that represent time is uncertain. The a...
Margaret L. Loper, Richard M. Fujimoto
FPGA
1999
ACM
122views FPGA» more  FPGA 1999»
14 years 15 hour ago
Exploiting FPGA-Features During the Emulation of a Fast Reactive Embedded System
This paper presents the emulation of an embedded system with hard real time constraints and response times of about 220µs. We show that for such fast reactive systems, the softwa...
Karlheinz Weiß, Thorsten Steckstor, Gernot K...
ER
2005
Springer
170views Database» more  ER 2005»
14 years 1 months ago
Conceptual Neighbourhood Diagrams for Representing Moving Objects
The idea of Conceptual Neighbourhood Diagram (CND) has proved its relevance in the areas of qualitative reasoning about time and qualitative reasoning about space. In this work, a ...
Nico Van de Weghe, Philippe De Maeyer
COCOON
1999
Springer
14 years 23 hour ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman