4781 search results - page 196 / 957 » Complexity at large |
CCGRID
2005
IEEE
14 years 4 months ago
2005
IEEE
Large distributed Grid systems pose new challenges in job scheduling due to complex workload characteristics and system characteristics. Due to the numerous parameters that must b...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
COCO
2009
Springer
14 years 5 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
SODA
2008
ACM
14 years 2 days ago
2008
ACM
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...