More on convolution of Riemannian manifolds.
Chen, Bang-Yen (2003)
Beiträge zur Algebra und Geometrie
Similarity:
Displaying similar documents to “An algorithm based on rolling to generate smooth interpolating curves on ellipsoids”
More on convolution of Riemannian manifolds.
Large equilateral triangles inscribed in the unit disk of a Minkowski plane.
Fabińska, Ewa, Lassak, Marek (2004)
Beiträge zur Algebra und Geometrie
Similarity:
A new regular multiplier embedding
Gemayqzel Bouza Allende, Jürgen Guddat (2013)
Kybernetika
Similarity:
Embedding approaches can be used for solving non linear programs P. The idea is to define a one-parametric problem such that for some value of the parameter the corresponding problem is equivalent to P. A particular case is the multipliers embedding, where the solutions of the corresponding parametric problem can be interpreted as the points computed by the multipliers method on P. However, in the known cases, either path-following methods can not be applied or the necessary conditions...
An analogue of Jeu de taquin for Littelmann's crystal paths.
van Leeuwen, Marc A.A. (1998)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
The Lotharingian impact on combinatorial mathematics: Myth or reality?
Foata, Dominique (2003)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Dynamic approach to optimum synthesis of a four-bar mechanism using a swarm intelligence algorithm
Edgar A. Portilla-Flores, Maria B. Calva-Yáñez, Miguel G. Villarreal-Cervantes, Paola A. Niño Suárez, Gabriel Sepúlveda-Cervantes (2014)
Kybernetika
Similarity:
This paper presents a dynamic approach to the synthesis of a crank-rocker four-bar mechanism, that is obtained by an optimization problem and its solution using the swarm intelligence algorithm called Modified-Artificial Bee Colony (M-ABC). The proposed dynamic approach states a mono-objective dynamic optimization problem (MODOP), in order to obtain a set of optimal parameters of the system. In this MODOP, the kinematic and dynamic models of the whole system are consider as well as a...
Chance constrained bottleneck transportation problem with preference of routes
Yue Ge, Minghao Chen, Hiroaki Ishii (2012)
Kybernetika
Similarity:
This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination...
Another interpretation of the number of derangements. (Une autre interprétation du nombre des dérangements.)
Désarménien, Jacques (1984)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Some debts I owe.
Andrews, George E. (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: