Buscar recursos académicos

Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1) their O(MN/sup 3/) computational complexity (where M is the number of objectives and N is th...

Convolutional networks are at the core of most state of-the-art computer vision solutions for a wide variety of tasks. Since 2014 very deep convolutional networks started to become mainstream, yielding substantial gains ...

The hallmarks of cancer conceptualization is a heuristic tool for distilling the vast complexity of cancer phenotypes and genotypes into a provisional set of underlying principles. As knowledge of cancer mechanisms has p...

Much of the complexity within cells arises from functional and regulatory interactions among proteins. The core of these interactions is increasingly known, but novel interactions continue to be discovered, and the infor...

A new density functional (DF) of the generalized gradient approximation (GGA) type for general chemistry applications termed B97-D is proposed. It is based on Becke's power-series ansatz from 1997 and is explicitly param...

In this paper, an analysis of the 4-(N2-1) Puzzle, which is a generalization of the (N2-1) Puzzle, is presented. This problem is of interest due to its algorithmic and computational complexity and its applications to rob...

The present paper poses a new method for computing the rotation of a ball in sport training situations, when the ball is approaching the goal line. The proposed method significantly reduces the hardware requirements asso...

In this article we will introduce certain considerations that must be taken into account while implementing the change operations of the belief change theory. The abstract models of bellief change make no considerations ...

Learning to store information over extended time intervals by recurrent backpropagation takes a very long time, mostly because of insufficient, decaying error backflow. We briefly review Hochreiter's (1991) analysis of t...

Decomposition is a basic strategy in traditional multiobjective optimization. However, it has not yet been widely used in multiobjective evolutionary optimization. This paper proposes a multiobjective evolutionary algori...

This paper presents a new vision Transformer, called Swin Transformer, that capably serves as a general-purpose backbone for computer vision. Challenges in adapting Transformer from language to vision arise from differen...

The resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software E...

Nowadays, the scientific applications are developed with more complexity and accuracy and these precisions need high computational resources to be executed. Also, the current trend in high performance computing (HPC) is ...

The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six...

By decomposing the image formation process into a sequential application of denoising autoencoders, diffusion models (DMs) achieve state-of-the-art synthesis results on image data and beyond. Additionally, their formulat...

Materias / palabras clave: governance, network studies, public policy, public management, complexity theory, computational social science; Political science

Materias / palabras clave: combinatorial group theory, computational group theory, algorithms, complexity theory, cryptology, information security; Science: Mathematics

Materias / palabras clave: theoertical computer science, computational complexity, quantum computing, algorithms, communication complexity; Science: Mathematics: Instruments and machines: Electronic computers. Computer science