ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Research
Technology
Social Sciences
Economy
Architecture and Urbanism
Languages
Literature
Computing
Computing
all records (74)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Brazil
Ukraine
South Africa
Canada
Spain
Italy
Switzerland
Australia
all records (76)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
8.019  Articles
1 of 803 pages  |  10  records  |  more records»
We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity able to capture mathematical aspects of different objects using as a case study polyominoes and polyhedral graphs. We review, study and apply a method for... see more

Among algorithmic-based frameworks for software development effort estimation, Use Case Points is one of the most used. Use Case Points is a well-known estimation framework designed mainly for object-oriented projects. Use Case Points uses the use case co... see more

Among algorithmic-based frameworks for software development effort estimation, Use Case Points is one of the most used. Use Case Points is a well-known estimation framework designed mainly for object-oriented projects. Use Case Points uses the use case co... see more

The data volume produced by the omic sciences nowadays was driven by the adoption of new generation sequencing platforms, popularly called NGS (Next Generation Sequencing). Among the analysis performed with this data, we can mention: mapping, genome assem... see more

Context. The general problem of constructing logical trees of recognition (classification) in the theory of artificial intelligence is considered in this paper. The object of this study is the concept of the classification tree (a logical and an algorithm... see more

In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LT2C2" role="presentation">LT2C2LT2C2LT^2C^2 ) satisfying the f... see more

La concepción de complejidad es una variable inherente a las ciudades inteligentes, por ello debe establecerse la diferencia entre los diferentes predecesores de la cultura occidental y oriental, y cómo aportan los pensadores que podrían considerarse pion... see more

On planar graphs, many classic algorithmic problems enjoy a certain ``square root phenomenon'' and can be solved significantly faster than what is known to be possible on general graphs: for example, Independent Set, 3-Coloring, Hamiltonian Cycle, Dominat... see more

We study algorithms and combinatorial complexity bounds for stable-matching Voronoi diagrams, where a set, S, of n point sites in the plane determines a stable matching between the points in  R2 and the sites in S such that  (i) the points ... see more

1 of 803 pages  |  10  records  |  more records»