5169 search results - page 267 / 1034 » Locality approximation using time |
194
click to vote
TSMC
2011
15 years 1 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
176
click to vote
DSN
2005
IEEE
16 years 7 days ago
2005
IEEE
This paper describes a framework for achieving node-level fault tolerance (NLFT) in distributed realtime systems. The objective of NLFT is to mask errors at the node level in orde...
156
click to vote
DSN
2006
IEEE
16 years 21 days ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
201
click to vote
RTSS
2005
IEEE
16 years 6 days ago
2005
IEEE
This paper presents a local algorithm for solving the universal parametric real-time model-checking problem. The problem may be phrased as follows: given a real-time system and te...
196
click to vote
PATMOS
2000
Springer
15 years 10 months ago
2000
Springer
Exploitation of data re-use in combination with the use of custom memory hierarchy that exploits the temporal locality of data accesses may introduce significant power savings, esp...