2485 search results - page 76 / 497 » Time Bounded Frequency Computations |
160
click to vote
CONCUR
2003
Springer
15 years 9 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
137
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
As real-time systems become more prevalent, there is a need to guarantee that these increasingly complex systems perform as designed. One technique involves a static analysis to p...
120
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
133
click to vote
ISHPC
2003
Springer
15 years 9 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
103
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...