Displaying 1321 – 1340 of 3923

Showing per page

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

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 set of constraints...

Dynamic programming for reduced NFAs for approximate string and sequence matching

Jan Holub (2002)

Kybernetika

searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given integer,...

Dynamiques recuites de type Feynman-Kac : résultats précis et conjectures

Pierre Del Moral, Laurent Miclo (2006)

ESAIM: Probability and Statistics

Soit U une fonction définie sur un ensemble fini E muni d'un noyau markovien irréductible M. L'objectif du papier est de comparer théoriquement deux procédures stochastiques de minimisation globale de U : le recuit simulé et un algorithme génétique. Pour ceci on se placera dans la situation idéalisée d'une infinité de particules disponibles et nous ferons une hypothèse commode d'existence de suffisamment de symétries du cadre (E,M,U). On verra notamment que contrairement au recuit simulé, toute...

EasyMSG : tools and techniques for an adaptive overlapping in SPMD programming

Pascal Havé (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

During the development of a parallel solver for Maxwell equations by integral formulations and Fast Multipole Method (FMM), we needed to optimize a critical part including a lot of communications and computations. Generally, many parallel programs need to communicate, but choosing explicitly the way and the instant may decrease the efficiency of the overall program. So, the overlapping of computations and communications may be a way to reduce this drawback. We will see a implementation of this techniques...

Economic assessment of the Champagne wine qualitative stock mecanism

Jacques Laye, Maximilien Laye (2006)

RAIRO - Operations Research

In the wine AOC system, the regulation of quantities performed by the professional organizations is aimed to smooth the variations of the quality of the wine due to the variations in the climate that affect the quality of the grapes. Nevertheless, this regulation could be damaging to the consumers due to the price increase resulting from the reduction of the quantities sold on the market. We propose a stochastic control model and a simulation tool able to measure the effects of this mechanism...

Currently displaying 1321 – 1340 of 3923