We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
—Despite much research on the throughput of relaying networks under idealized interference models, many practical wireless networks rely on physical-layer protocols that preclude...
— Generalized selection multiuser diversity (GSMuD) is a new scheduling scheme which provides a near-optimal low-complexity solution to parallel access multiuser scheduling. In t...
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
Konrad Stocker, Donald Kossmann, Reinhard Braumand...
A framework for requirements analysis is proposed that accounts for individual and personal goals, and the effect of time and context on personal requirements. The implications of...
Alistair G. Sutcliffe, Stephen Fickas, McKay Moore...