6978 search results - page 1251 / 1396 » Reframing Requirements Analysis |
125
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
121
click to vote
SPAA
2009
ACM
16 years 5 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
147
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
138
click to vote
CAV
2009
Springer
16 years 5 months ago
2009
Springer
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
162
click to vote
TCC
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...