477 search results - page 45 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
GECCO
2010
Springer
14 years 1 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
IOR
2011
13 years 3 months ago
2011
We consider a pricing problem in an environment where the customers’ willingness-to-pay (WtP) distribution may change at some point over the selling horizon. Customers arrive se...
WDAG
2010
Springer
13 years 7 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...