Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “complexity reduction”

Automatic Complexity Reduction

D. White, Mark Stowell, K. Lange · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2014

This is the final report for LDRD project 12-ERD-038 titled Automatic Complexity Reduction. The original budget request was for $\$1.1$M for three years, the project was instead funded at $\$420$K for three years. The team consisted the PI Daniel White, post-doctoral researcher Kyle Lange, and staff member Mark Stowell. This work largely builds upon the research of Matt Stephanson, who was a summer scholar at LLNL. This report will provide a high level overview of the problem and the solution approach, as well as results, and future research directions.

Cited by 0Open access

Reduction of Complexity

Helmut Strasser · 2000

This paper is devoted to a presentation of the pertaining results on a low level of mathematical sophistication. Let us give some hints on the organization of the paper. In Section 2 we present those two classical approaches of cluster analysis and vector quantization which are the starting points of our further considerations. As has been known for some time these approaches are equivalent and nothing else than two views of the same idea. Sections 2 and 3 are concerned with the generalization of the classical ideas. This extension offers a much greater class of partioning methods. Our approach is based on similarity measures, which serve as an intuitive background of the methods. Let us indicate as a first motivation that our generalization allows to treat claasical methods and recent algorithms of AI from one viewpoint (see Example (6.26)). A more substantial foundation will be given in 2000. Section 5 is the main part of the paper. We explain in a simplified way how decision theoretic arguments lead to criteria for the choice of partitioning methods. In this Section it will turn out how statistical decision theory may lead us to the class of methods defined in Section 3. Moreover, it will become clear which role statistical models have to play for our approach of data analysis. After all, claiming robustness we arrive at a class of new methods which are positioned between classical cluster analysis and modern AI. Helmut Strasser 5 In this paper we do not support our results by empirical examples. For this we refer to experimental studies by Rahnenfhrer, 1999, and by Steiner, 1999. Section 6 contains some brief remarks on algorithms for the computational realization of our methods. We confine ourselves to the basics and for further information we refer to Ptzelberge...

Cited by 0

Reduction of Complexity

Josef A. Mazanec, Helmut Strasser · Interdisciplinary studies in economics and management · 2000

Cited by 12

Computational complexity reduction.

Mohammed Albekairi (21615782), Meshari D. Alanazi (21615785), Turki M. Alanazi (17990269) et al. · Figshare · 2025

<div> Human-robot interaction has gained significant attention in various domains, including healthcare, customer service, and industrial automation. High computational cost, inefficient service matching, and elevated failure rates in dynamic service contexts are some primary disadvantages of existing query-processing systems. This research introduces a Hybrid Intelligent Computing Model (HICM) to improve robots’ ability to process inquiries autonomously. The goal is to make robots better at responding to human questions in real time with efficient, personalized, and context-specific solutions. Using self-organized computing approaches, robotic agents can reliably provide end-users with services suited to their demands. Due to their autonomous nature, robots must be able to calculate quickly and accurately to provide timely services. To meet these needs, the proposed HICM incorporates a sophisticated decision-support system to handle human questions and find the appropriate services. Within this decision-making framework, the model evaluates the characteristics and relevance of questions about accessible services by combining annealing and Tabu Search approaches. To avoid addressing queries incompatibly, the Tabu Search technique approaches query resolution as a non-convergent optimization issue. Comparing HICM’s performance to other models reveals significant improvements over CDS, DGTA, and CCS. In particular, HICM reduced calculation time by 8.67%, service time by 15.09%, and failure rates by 7.87%. In terms of important metrics, HICM fared better than the competing models. Its success factor was 11.8% higher, its matching ratio was 14.88% higher, and its failure rates were 6.22% lower. These findings demonstrate the model’s efficiency and reliability in terms of robotic query processing and real-time service delivery. </div>

Cited by 0Open access

Reduction of Complexity

Dirk Berg‐Schlosser · Palgrave Macmillan UK eBooks · 2012

As mentioned before, in comparative politics at the macro-level the “many variables — small N” situation prevails (see also Chapter 3 in this book). In such a situation an analysis suffers from “over-determination”, that is, more distinct causal relationships cannot be established when there are more variables than cases (Przeworski and Teune 1970: 23). The “degrees of freedom”, in statistical terms, that is, the number of cases minus the number of variables minus one, are negative. This problem can be attacked, basically, in three ways (see also Lijphart 1971, 1975; Collier 1993).

Cited by 1

FTTdp: ONU Complexity Reduction

Michael P. McGarry, Elliott I. Gurrola · Optical Fiber Communication Conference · 2014

We define and evaluate two strategies for reducing the complexity of an optical network unit deployed in a hybrid PON/DSL access network. This complexity reduction will result in reduced energy consumption and cost.

Cited by 0

Video encoder complexity reduction

Ming-Yan Chan · 2005

Video encoder complexity reduction by Ming-Yan Chan thesis 2005 xvi, 88 leaves : ill. (some col.) ; 30 cm Video encoder complexity reduction is a very active research area in the past 20 years. Many researchers have developed fast algorithms…Read more ›

Cited by 0

Video encoder complexity reduction

Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 2005

Video encoder complexity reduction by Ming-Yan Chan thesis 2005 xvi, 88 leaves : ill. (some col.) ; 30 cm Video encoder complexity reduction is a very active research area in the past 20 years. Many researchers have developed fast algorithms…Read more ›

Cited by 0

Complexity reduction of astrochemical networks

Tommaso Grassi, S. Bovino, F. A. Gianturco et al. · Monthly Notices of the Royal Astronomical Society · 2012

We present a new computational scheme aimed at reducing the complexity of the chemical networks in astrophysical models, one which is shown to markedly improve their computational efficiency. It contains a flux-reduction scheme that permits us to deal with both large and small systems. This procedure is shown to yield a large speed-up of the corresponding numerical codes and provides good accord with the full network results. We analyse and discuss two examples involving chemistry networks of the interstellar medium and show that the results from the present reduction technique reproduce very well the results from fuller calculations.

Cited by 18Open access

Complexity Reduction for Option Pricing

Mirco Mahlstedt · mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) · 2017

For financial institutions, the need of executing recurrent tasks such as pricing, calibration and risk assessment accurately and in real-time, sets the direction to complexity reduction. We first investigate the market practice method de-Americanization, suggest Chebyshev interpolation in the parameter space and solve dynamic programming problem via Chebyshev interpolation.

Cited by 1Open access

Analogy Comprehension as Complexity Reduction

van Klink, B.M.J. · Data Archiving and Networked Services (DANS) · 1996

In this paper we try to find an explanation for the interesting phenomenon that competent langugage users have little difficulty understanding non-trivial metaphors in ordinary discours. According to the standard interaction view, in metaphor commonplaces associated with the vehicle are projected on the topic. This account has to be dismissed as too general (when not untrue in several cases). On the basis of an elaborated theory of similarity we propose an alternative, more precise, model for analogy comprehesion. This model involves a systematic reduction of complexity in three stages: in stage one the relevant (manifest, specific, and ordinary) features of the vehicle are selected. In stage two we investigate which of these can be meaningfully applied to the topic. Generally, this will reduce even further the set of possible relevant features. The last stage has an important control function: we check whether the remaining set of features makes sense within the linguistic context in which the metaphor occurs. In the light of new data, we may be forced to delete (some of) the features found in stage two and replace them by new ones. By means of this model we are able to reconstruct logically the functioning of metaphors as well as other types of analogy.

Cited by 0

Expected Complexity of Barcode Reduction

Barbara Giunti, Guillaume Houry, Michael Kerber et al. · Journal of Applied and Computational Topology · 2025

We study the algorithmic complexity of computing the persistence barcode of a randomly generated filtration. We provide a general technique to bound the expected complexity of reducing the boundary matrix in terms of the density of its reduced form. We apply this technique finding upper bounds for the average fill-in (number of non-zero entries) of the boundary matrix on Čech, Vietoris-Rips and Erdős-Rényi filtrations after matrix reduction, thus obtaining bounds on the expected complexity of the barcode computation. Our method is based on previous results on the expected Betti numbers of the corresponding complexes. Our fill-in bounds for Čech and Vietoris-Rips complexes are asymptotically tight up to a logarithmic factor. In particular, both our fill-in and computation bounds are better than the worst-case estimates. We also provide an Erdős-Rényi filtration realizing the worst-case fill-in and computation.

Cited by 0Open access