359 search results - page 46 / 72 » Order Scheduling Models: Hardness and Algorithms |
130
click to vote
PPOPP
2009
ACM
16 years 10 days ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
201
click to vote
POPL
2003
ACM
16 years 3 days ago
2003
ACM
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
111
click to vote
CASES
2005
ACM
15 years 1 months ago
2005
ACM
Customisable embedded processors are becoming available on the market, thus making it possible for designers to speed up execution of applications by using Application-specific F...
101
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
CAD
2004
Springer
14 years 11 months ago
2004
Springer
We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using e...