17582 search results - page 398 / 3517 » From Distributed Sequential Computing to Distributed Paralle... |
135
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...
154
click to vote
PDCAT
2005
Springer
16 years 9 days ago
2005
Springer
Chocolat/SMV is a translator that takes a CafeOBJ specification of a transition system called an OTS and generates an SMV specification of a finite version of the OTS. The prim...
197
click to vote
ICDCS
2011
IEEE
14 years 6 months ago
2011
IEEE
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
167
click to vote
SPAA
1992
ACM
15 years 11 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
163
click to vote
EUROPAR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The High Performance Fortran (HPF) benchmark suite HPFBench was designed for evaluating the HPF language and compilers on scalable architectures. The functionality of the...