5448 search results - page 215 / 1090 » Breakpoints and Time in Distributed Computations |
140
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
158
click to vote
ADHOCNETS
2009
Springer
15 years 7 months ago
2009
Springer
This paper is a sequel of previous work, in which we have studied the traffic management problem in UMTS. The main objective was to improve the spectral efficiency of cellular netw...
161
click to vote
SBACPAD
2008
IEEE
15 years 11 months ago
2008
IEEE
Single processor technology has been evolving across last decades, but due to physical limitations of chip manufacturing process, the industry is pursuing alternatives to sustain ...
172
click to vote
FIDJI
2003
Springer
15 years 9 months ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...
124
click to vote
ESOP
2000
Springer
15 years 8 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...