1295 search results - page 81 / 259 » Palimpsests of Time and Place |
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
119
click to vote
CASES
2007
ACM
15 years 3 months ago
2007
ACM
This paper presents the first automatic scheme to allocate local (stack) data in recursive functions to scratch-pad memory (SPM) in embedded systems. A scratch-pad is a fast direct...
106
click to vote
CORR
2010
Springer
15 years 4 hour ago
2010
Springer
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Coverage and connectivity issues of three-dimensional (3D) networks are addressed in [2], but that work assumes that a node can be placed at any arbitrary location. In this work, ...
MCS
2006
Springer
14 years 12 months ago
2006
Springer
We investigate the amount of cooperation between agents in a population during reward collection that is required to minimize the overall collection time. In our computer simulati...