Cost-Based Approach to Complexity: A Common Denominator?

05/11/2019
by   Luciano da F. Costa, et al.
0

Complexity remains one of the central challenges in science and technology. Although several approaches at defining and/or quantifying complexity have been proposed, at some point each of them seems to run into intrinsic limitations or mutual disagreement. Two are the main objectives of the present work: (i) to review some of the main approaches to complexity; and (ii) to suggest a cost-based approach that, to a great extent, can be understood as an integration of the several facets of complexity while keeping its meaning for humans in mind. More specifically, it is poised that complexity, an inherently relative and subjective concept, can be summarized as the cost of developing a model, plus the cost of its respective operation. As a consequence, complexity can vary along time and space. The proposal is illustrated respectively to several applications examples, including a real-data base situation.

READ FULL TEXT
research
09/06/2017

Cost Modeling and Projection for Stacked Nanowire Fabric

To continue scaling beyond 2-D CMOS with 3-D integration, any new 3-D IC...
research
11/27/2019

A tale of two toolkits, report the second: bake off redux. Chapter 1. dictionary based classifiers

Time series classification (TSC) is the problem of learning labels from ...
research
10/24/2019

A Review of the End-to-End Methodologies for Clinical Concept Extraction

Our study provided a review of the concept extraction literature from Ja...
research
04/18/2018

On Abelian Longest Common Factor with and without RLE

We consider the Abelian longest common factor problem in two scenarios: ...
research
02/03/2019

Knapsack Problem With Cardinality Constraint: A Faster FPTAS Through the Lens of Numerical Analysis and Applications

We study the K-item knapsack problem (, 1.5-dimensional knapsack problem...
research
01/18/2020

RCELF: A Residual-based Approach for InfluenceMaximization Problem

Influence Maximization Problem (IMP) is selecting a seed set of nodes in...
research
02/03/2019

A Faster FPTAS for Knapsack Problem With Cardinality Constraint

We study the K-item knapsack problem (, 1.5-dimensional KP), which is a ...

Please sign up or login with your details

Forgot password? Click here to reset