Sciweavers

7796 search results - page 1155 / 1560
» On Generalized Schur Numbers
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
WMRD
1990
15 years 11 months ago
Replication in Ficus Distributed File Systems
Ficus is a replicated general ling environment for Unix intended to scale to very large nationwide networks. The system employs an optimistic one copy availability" model in ...
Gerald J. Popek, Richard G. Guy, Thomas W. Page Jr...
CCS
2009
ACM
15 years 11 months ago
On lightweight mobile phone application certification
Users have begun downloading an increasingly large number of mobile phone applications in response to advancements in handsets and wireless networks. The increased number of appli...
William Enck, Machigar Ongtang, Patrick Drew McDan...
CODES
2007
IEEE
15 years 11 months ago
Energy efficient co-scheduling in dynamically reconfigurable systems
Energy consumption is a major issue in dynamically reconfigurable systems because of the high power requirements during repeated configurations. Hardware designs employ low power ...
Pao-Ann Hsiung, Pin-Hsien Lu, Chih-Wen Liu
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
15 years 11 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...
« Prev « First page 1155 / 1560 Last » Next »