12519 search results - page 288 / 2504 » Approximation Problems Categories |
205
click to vote
AAECC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
142
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
In this paper, the complex-step method is applied in the setting of numerical optimisation problems involving dynamical systems modelled as nonlinear differential equations. The m...
145
click to vote
JGAA
2006
15 years 6 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
171
click to vote
ALGORITHMICA
1999
15 years 6 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
178
click to vote
IPL
2002
15 years 6 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...