2109 search results - page 225 / 422 » Solving Necklace Constraint Problems |
139
click to vote
ENTCS
2008
15 years 6 months ago
2008
We address the problem of component reuse by describing a quotient operation. Starting from the specifications of the behaviors of the component and of the desired overall system,...
134
Voted
AUTOMATICA
2006
15 years 6 months ago
2006
: A path-following problem for linear systems with unstable zero dynamics is solved. While the original control variable steers the system output along the path, the path parameter...
148
Voted
IJCV
2006
15 years 6 months ago
2006
We present a new approach to the algorithmic study of planar curves, with applications to estimations of contours in images. We construct spaces of curves satisfying constraints su...
167
Voted
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
AUTOMATICA
1999
15 years 5 months ago
1999
The square-root information filter and smoother algorithms have been generalized to handle singular state transition matrices and perfect measurements. This has been done to allow...