697 search results - page 12 / 140 » On the Theory of Average Case Complexity |
164
click to vote
DC
2000
15 years 6 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
210
click to vote
DATE
2010
IEEE
15 years 4 months ago
2010
IEEE
The H.264/AVC video encoder standard significantly improves the compression efficiency by using variable block-sized Inter (P) and Intra (I) Macroblock (MB) coding modes. In this p...
153
click to vote
WADS
2005
Springer
16 years 4 days ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
164
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
249
click to vote
AAAI
2012
13 years 9 months ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...