11562 search results - page 150 / 2313 » Parallel Imaging Problem |
130
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
222
click to vote
ARC
2012
Springer
14 years 17 days ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
143
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
160
Voted
ISCC
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
145
click to vote
PDCAT
2005
Springer
15 years 10 months ago
2005
Springer
Scheduling divisible workloads in distributed systems has been one of the interesting research problems over the last few years. Most of the scheduling algorithms previously intro...