Cerca risorse accademiche

We introduce and discuss a new computational model for the HermiteLagrange interpolation with nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it....

Formulation of the problem. In scientific research in sociology, education, physics, chemistry and other sciences, methods of correlation analysis are used. Correlation coefficients are used to determine the existence of...

This study develops an innovative framework for the multi-objective optimization of multi-channel supply chains under uncertainty. The framework integrates the D-number model, an extension of Dempster–Shafer Theory (DS...

The travelling salesman problem (or The sales representative problem) has been insufficiently explored so far. One of the first results on this issue was provided by Euler in 1759 (The problem of moving a knight on the c...

Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and Linear Diophantine Equations. Algorit...

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 ...

Many problems of recent interest in statistics and machine learning can be posed in the framework of convex optimization. Due to the explosion in size and complexity of modern datasets, it is increasingly important to be...

Many problems of recent interest in statistics and machine learning can be posed in the framework of convex optimization. Due to the explosion in size and complexity of modern datasets, it is increasingly important to be...

Preface to the Second Edition. Preface to the First Edition. Acknowledgments for the Second Edition. Acknowledgments for the First Edition. 1. Introduction and Preview. 1.1 Preview of the Book. 2. Entropy, Relative Entro...

Due to the simplicity of their implementations, least square support vector machine (LS-SVM) and proximal support vector machine (PSVM) have been widely used in binary classification applications. The conventional LS-SVM...

FOUNDATIONS. The Scope of Integer and Combinatorial Optimization. Linear Programming. Graphs and Networks. Polyhedral Theory. Computational Complexity. Polynomial-Time Algorithms for Linear Programming. Integer Lattices....

1. Fundamental Concepts. Definitions and examples. Paths and proofs. Vertex degrees and counting. Degrees and algorithmic proof. 2. Trees and Distance. Basic properties. Spanning trees and enumeration. Optimization and t...

Industrial planning has experienced notable advancements since its beginning by the middle of the 20th century. The importance of its application within the several industries where it is used has been demonstrated, rega...

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the...

Previous article Next article An Algorithm for Least-Squares Estimation of Nonlinear ParametersDonald W. MarquardtDonald W. Marquardthttps://doi.org/10.1137/0111030PDFPDF PLUSBibTexSections ToolsAdd to favoritesExport Ci...

El diseño de sistemas informáticos para sitios de negocios electrónicos puede realizarse con configuraciones variadas de recursos de hardware, software y comunicaciones. Fundamentalmente debe considerar los requerimie...

Materie / parole chiave: algorithms and complexity theory, artificial intelligence, networking and security systems, programming languages, system and software engineering, theoretical foundations of computer science; Science: Mathematics: Instr...

Materie / parole chiave: algorithms and complexity theory, computing and computer architecture, computer networks, artificial intelligence, security and encryption, performance evaluation of computer systems and queuing systems; Science: Mathema...

We describe O(n) time algorithms for finding the minimum weighted dominating induced matching of chordal, dually chordal, biconvex, and claw-free graphs. For the first three classes, we prove tight O(n) bounds on the max...

This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network...

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...

The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on th...

A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers. For a particular choice of parameters, the algorithm provides a super astronomical period of 2 19937 −1 and 623-dime...

A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented. The technique is applicable to a wide variety of the classification functions, including Perceptrons, p...