Displaying similar documents to “Event-Based Proof of the Mutual Exclusion Property of Peterson’s Algorithm”

A Bermúdez–Moreno algorithm adapted to solve a viscoplastic problem in alloy solidification processes

P. Barral, P. Quintela, M. T. Sánchez (2014)

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

Similarity:

The aim of this work is to present a computationally efficient algorithm to simulate the deformations suffered by a viscoplastic body in a solidification process. This type of problems involves a nonlinearity due to the considered thermo-elastic-viscoplastic law. In our previous papers, this difficulty has been solved by means of a duality method, known as Bermúdez–Moreno algorithm, involving a multiplier which was computed with a fixed point algorithm or a Newton method. In this paper,...

Using Inside-Outside Algorithm for Estimation of the Offspring Distribution in Multitype Branching Processes

Daskalova, Nina (2010)

Serdica Journal of Computing

Similarity:

Multitype branching processes (MTBP) model branching structures, where the nodes of the resulting tree are particles of different types. Usually such a process is not observable in the sense of the whole tree, but only as the “generation” at a given moment in time, which consists of the number of particles of every type. This requires an EM-type algorithm to obtain a maximum likelihood (ML) estimate of the parameters of the branching process. Using a version of the inside-outside algorithm...

A branch-and-cut algorithm for a resource-constrained scheduling problem

Renaud Sirdey, Hervé L. M. Kerivin (2007)

RAIRO - Operations Research

Similarity:

This paper is devoted to the exact resolution of a strongly -hard resource-constrained scheduling problem, the , which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance, in terms of both exact...

An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem

Peng Wuliang, Huang Min, Hao Yongping (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...

Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem

Ireneusz Czarnowski, Piotr Jędrzejowicz (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning...