Sciweavers

1279 search results - page 162 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
ISSAC
1995
Springer
119views Mathematics» more  ISSAC 1995»
14 years 15 days ago
The Singular Value Decomposition for Polynomial Systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
Robert M. Corless, Patrizia M. Gianni, Barry M. Tr...
NIPS
1990
13 years 10 months ago
Convergence of a Neural Network Classifier
In this paper, we show that the LVQ learning algorithm converges to locally asymptotic stable equilibria of an ordinary differential equation. We show that the learning algorithm ...
John S. Baras, Anthony LaVigna
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
13 years 10 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
UAI
2008
13 years 10 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
COCOON
2010
Springer
14 years 1 months ago
Detecting Areas Visited Regularly
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
Bojan Djordjevic, Joachim Gudmundsson