The following pages link to A Complexity Measure (Q4122801):
Displaying 49 items.
- Divergent exploration in design with a dynamic multiobjective optimization formulation (Q381985) (← links)
- Partial evaluation of string obfuscations for Java malware detection (Q511016) (← links)
- The structured complexity of object-oriented programs (Q596971) (← links)
- Survey questionnaires and graphs (Q887267) (← links)
- An efficient method to generate feasible paths for basis path testing (Q963407) (← links)
- Reading beside the lines: Using indentation to rank revisions by complexity (Q1021465) (← links)
- String patterns of leading digits (Q1050770) (← links)
- On the detection of unstructuredness in flowgraphs (Q1098619) (← links)
- Cyclomatic numbers do not measure complexity of unstructured programs (Q1151018) (← links)
- Complexity measures for concurrent programs based on information- theoretic metrics (Q1210320) (← links)
- Measuring prime program complexity (Q1328506) (← links)
- The subprogram problem for software metric design (Q1350112) (← links)
- Choosing the best model: Level of detail, complexity, and model performance (Q1376593) (← links)
- Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms. (Q1413809) (← links)
- Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
- An entropy based measure for comparing distributions of complexity (Q1619478) (← links)
- Quantification of software code coverage using artificial bee colony optimization based on Markov approach (Q1640487) (← links)
- Analysis of high structural class coupling in object-oriented software systems (Q1700983) (← links)
- Project for intercomparison of landsurface parameterization schemes: Application of some structural complexity metrics (Q1894048) (← links)
- FEVS: a functional equivalence verification suite for high-performance scientific computing (Q1949768) (← links)
- Partition refinement of component interaction automata (Q1951613) (← links)
- Why there is no general solution to the problem of software verification (Q2151520) (← links)
- Software defect prediction model based on distance metric learning (Q2156978) (← links)
- Multiscale horizontal visibility entropy: measuring the temporal complexity of financial time series (Q2164561) (← links)
- A generalized mathematical theory of structured programming (Q2265794) (← links)
- Complexity of node coverage games (Q2344734) (← links)
- Spectral complexity of directed graphs and application to structural decomposition (Q2424711) (← links)
- Secure cloud model for intellectual privacy protection of arithmetic expressions in source codes using data obfuscation techniques (Q2672580) (← links)
- Computing ripple effect for software maintenance (Q2744753) (← links)
- Evaluation method of software reliability based on SPN model (Q2825282) (← links)
- Obfuscation Combiners (Q2829229) (← links)
- Partial Evaluation for Java Malware Detection (Q2949704) (← links)
- Control flow graphs and code coverage (Q3083920) (← links)
- The servicisation of the cutting tool supply chain (Q3163777) (← links)
- Flowchart recognition—a syntactic approach (Q3352520) (← links)
- Using the Support Vector Machine as a Classification Method for Software Defect Prediction with Static Code Metrics (Q3405742) (← links)
- Software Defect Classification: A Comparative Study of Rough-Neuro-fuzzy Hybrid Approaches with Linear and Non-linear SVMs (Q3628692) (← links)
- A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS (Q3719804) (← links)
- On the number of cycles in a graph (Q4605353) (← links)
- Semi-automatic grammar recovery (Q4791063) (← links)
- Design, implementation and evolution of object oriented frameworks: concepts and guidelines (Q4791117) (← links)
- On the estimation of the parameters for the Littlewood model in software reliability (Q4850125) (← links)
- Measures for Evaluating the Software Agent Pro-Activity (Q4932648) (← links)
- (Q5089153) (← links)
- Software modules categorization through likelihood and bayesian analysis of finite dirichlet mixtures (Q5123513) (← links)
- Complexity of Leading Digit Sequences (Q5130749) (← links)
- Exact Solution of the Evasive Flow Capturing Problem (Q5131542) (← links)
- The design of decision trees in the framework of granular data and their application to software quality models (Q5951774) (← links)
- Formalization of structural test cases coverage criteria for quantum software testing (Q6161768) (← links)
