2080 search results - page 91 / 416 » Measuring empirical computational complexity |
107
click to vote
ISSTA
2000
ACM
15 years 4 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
116
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
111
click to vote
CSCWD
2008
Springer
15 years 1 months ago
2008
Springer
This research explored a new direction of improving collaborative design by performance measurement. More specifically, a novel 3-dimensional performance measurement model is deve...
SIGOPSE
2004
ACM
15 years 5 months ago
2004
ACM
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
115
click to vote
CSR
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...