Sciweavers

11328 search results - page 44 / 2266
» Timed Branching Processes
Sort
View
127
Voted
RTSS
2003
IEEE
15 years 7 months ago
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes
Real-time systems are growing in complexity and realtime and soft real-time applications are becoming common in general-purpose computing environments. Thus, there is a growing ne...
Scott A. Brandt, Scott A. Banachowski, Caixue Lin,...
IEEEPACT
2009
IEEE
15 years 8 months ago
CPROB: Checkpoint Processing with Opportunistic Minimal Recovery
—CPR (Checkpoint Processing and Recovery) is a physical register management scheme that supports a larger instruction window and higher average IPC than conventional ROB-style re...
Andrew D. Hilton, Neeraj Eswaran, Amir Roth
ISMIS
1999
Springer
15 years 6 months ago
Improving Backtrack Search for SAT by Means of Redundancy
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
Laure Brisoux, Éric Grégoire, Lakhda...
FORTE
2001
15 years 3 months ago
A Symbolic Semantics and Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to da...
Muffy Calder, Carron Shankland