Sciweavers

680 search results - page 15 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
COMSIS
2010
13 years 5 months ago
Metrics for evaluation of metaprogram complexity
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
Robertas Damasevicius, Vytautas Stuikys
TEC
2010
173views more  TEC 2010»
13 years 2 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 1 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
COCO
1995
Springer
134views Algorithms» more  COCO 1995»
13 years 11 months ago
Towards Average-Case Complexity Analysis of NP Optimization Problems
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
Rainer Schuler, Osamu Watanabe
BIRTHDAY
2003
Springer
14 years 1 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem