3108 search results - page 575 / 622 » The Elements of Computer Credibility |
149
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
156
click to vote
CGF
2002
15 years 4 months ago
2002
With the advent of sketch-based methods for shape construction, there's a new degree of power available in the rapid creation of approximate shapes. Sketch [Zeleznik, 1996] s...
249
click to vote
MICRO
2000
IEEE
15 years 4 months ago
2000
IEEE
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
141
click to vote
JPDC
1998
15 years 4 months ago
1998
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
140
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...