Sciweavers

2080 search results - page 8 / 416
» Measuring empirical computational complexity
Sort
View
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
13 years 18 days ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
COCOON
2007
Springer
14 years 4 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
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...
Shengyu Zhang
CAE
2007
14 years 6 days ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert
AC
2002
Springer
13 years 9 months ago
Empirical Studies of Quality Models in Object-Oriented Systems
Measuring structural design properties of a software system, such as coupling, cohesion, or complexity, is a promising approach towards early quality assessments. To use such meas...
Lionel C. Briand, Jürgen Wüst
AMC
2007
108views more  AMC 2007»
13 years 10 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh