10608 search results - page 298 / 2122 » Complexity of O'Hara's Algorithm |
116
Voted
RTAS
1995
IEEE
15 years 4 months ago
1995
IEEE
The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic realtime task systems. This paper discusses feasibility decision for a given real...
121
click to vote
PDCAT
2009
Springer
15 years 7 months ago
2009
Springer
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...
98
Voted
NLDB
2005
Springer
15 years 6 months ago
2005
Springer
For most English words, dictionaries give various senses: e.g., “bank” can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a gi...
ISPD
2003
ACM
15 years 5 months ago
2003
ACM
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
110
Voted
AI
2003
Springer
15 years 5 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...