Sciweavers

1795 search results - page 274 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
IPPS
2008
IEEE
16 years 17 days ago
SLA-based resource allocation in cluster computing systems
Resource allocation is a fundamental but challenging problem due to the complexity of cluster computing systems. In enterprise service computing, resource allocation is often asso...
Kaiqi Xiong, Harry G. Perros
RTCSA
2008
IEEE
16 years 16 days ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
ASIAMS
2007
IEEE
16 years 15 days ago
On Syntactic Composability and Model Reuse
Composability, the capability to select and assemble offthe-shelf model components in various combinations to satisfy user requirements, is an appealing approach in reducing the t...
Claudia Szabo, Yong Meng Teo
154
Voted
DATE
2007
IEEE
155views Hardware» more  DATE 2007»
16 years 15 days ago
Design fault directed test generation for microprocessor validation
Functional validation of modern microprocessors is an important and complex problem. One of the problems in functional validation is the generation of test cases that has higher p...
Deepak Mathaikutty, Sandeep K. Shukla, Sreekumar V...
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 14 days ago
The Rigorous Implementation of a Fair Exchange Protocol for Non-repudiable Web Service Interactions - a case study
The correct implementation of security protocols is a challenging task. To achieve a high degree of confidence in an implementation, as with any software, ideally one requires bot...
Nick Cook, Paul Robinson, Santosh K. Shrivastava