1866 search results - page 147 / 374 » A Computational Journey into Nonlinearity |
158
click to vote
BMVC
1997
15 years 7 months ago
1997
A new geometrical approach in solving the shape from shading problem of Lambertian model is discussed. It is shown that this problem is bound by two local constraints through the ...
159
click to vote
EOR
2010
15 years 6 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
177
click to vote
CMOT
2000
15 years 6 months ago
2000
A variety of different multi-agent (competitive) network models have been described in the literature. Computational techniques for solving such models often involve the iterative...
181
click to vote
AUTOMATICA
1999
15 years 6 months ago
1999
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...
206
click to vote
MICS
2007
15 years 6 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...