131 search results - page 21 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
107
click to vote
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
109
click to vote
COCO
2008
Springer
15 years 1 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
105
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...