2479 search results - page 259 / 496 » A Computational Theory of Working Memory |
198
click to vote
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
15 years 11 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
171
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
163
click to vote
LCN
2005
IEEE
16 years 7 days ago
2005
IEEE
— The seminar work of Gupta and Kumar [1] showed that multi-hop wireless networks with capacity scalable with the number of nodes, n, are achievable in theory. The transport capa...
170
click to vote
HIPC
2005
Springer
16 years 5 days ago
2005
Springer
We recently proposed a new approach to parallelization, by decomposing the time domain, instead of the conventional space domain. This improves latency tolerance, and we demonstrat...
161
click to vote
IWMM
2010
Springer
15 years 8 months ago
2010
Springer
With the current developments in CPU implementations, it becomes obvious that ever more parallel multicore systems will be used even in embedded controllers that require real-time...