4463 search results - page 775 / 893 » computing 2000 |
103
click to vote
ESA
2000
Springer
15 years 4 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
117
Voted
FC
2000
Springer
15 years 4 months ago
2000
Springer
For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
106
Voted
FMCAD
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
102
click to vote
FMCAD
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...
135
Voted
FPGA
2000
ACM
15 years 4 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...