13214 search results - page 2464 / 2643 » Pseudorandomness for network algorithms |
166
click to vote
FOSAD
2000
Springer
15 years 10 months ago
2000
Springer
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...
201
click to vote
FPGA
2000
ACM
15 years 10 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
195
click to vote
HPDC
2000
IEEE
15 years 10 months ago
2000
IEEE
Increased platform heterogeneity and varying resource availability in distributed systems motivates the design of resource-aware applications, which ensure a desired performance l...
153
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
172
click to vote
COOPIS
1997
IEEE
15 years 10 months ago
1997
IEEE
Workflows are activities involving the coordinated execution of multiple tasks performed by different processing entities, mostly in distributed heterogeneous environments which a...