Sciweavers

3934 search results - page 617 / 787
» Approximate Schedulability Analysis
Sort
View
IPL
2010
112views more  IPL 2010»
15 years 5 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
JUCS
2010
108views more  JUCS 2010»
15 years 5 months ago
Integrating Social Networks for Context Fusion in Mobile Service Platforms
: It is important for mobile service providers to be aware of user contexts and to provide contextually relevant mobile services to users. Thereby, in this paper, we propose a nove...
Jason J. Jung
TCOM
2010
111views more  TCOM 2010»
15 years 4 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
WICOMM
2010
91views more  WICOMM 2010»
15 years 4 months ago
A sensing-based cognitive coexistence method for interfering infrastructure and ad hoc systems
The rapid proliferation of wireless systems makes interference management more and more important. This paper presents a novel cognitive coexistence framework, which enables an in...
Stefan Geirhofer, Lang Tong, Brian M. Sadler
IPPS
2010
IEEE
15 years 4 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha