2652 search results - page 326 / 531 » Privacy-preserving linear programming |
105
click to vote
PVM
2004
Springer
15 years 8 months ago
2004
Springer
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
132
click to vote
SPIN
2004
Springer
15 years 8 months ago
2004
Springer
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
117
click to vote
ISLPED
2003
ACM
15 years 8 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
128
click to vote
AC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. As semiconductor technology strides towards billions of transistors on a single die, problems concerned with deep sub-micron process features and design productivity call...
136
click to vote
CAV
2003
Springer
15 years 8 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...