An optimal arc consistency algorithm AC-4 was given by Mohr and Henderson [8]. AC4 has cost 0(ea), and cost (na) for scene labelling. Although their algorithm is indeed optimal, under certain conditions a constraint satisfaction problem can be transformed into a less complex problem. In this paper, we present conditions and mechanisms for such transformations, and show how to factor relations i...

Interdependence of minor ordering costs occurs in joint replenishment of inventory when the cost of placing an item in an order depends on which other items are also in the order. In this paper, we propose an evolutionary algorithm (EA) for joint replenishment of inventory which allows for the interdependence of minor ordering costs. Since solutions to the joint replenishment problem (JRP) can ...

This paper presents a new direct maximum power point tracking (MPPT) with reference voltage (Vref) based on the metaheuristic earthquake algorithm (EA) where optimization variable is Vref for hard-switching converters. The efficiency and performance of EA-MPPT-Vref compared perturb-and-observe (P&O) counterpart technique due to fact that it widely used commercial products. Static dynamic re...

Abstract: A comparison study between Electromagnetism-Like Algorithm (EM) and Genetic Algorithm (GA) has been presented in this work to solve the Inverse Kinematics (IK) of a four-link planar robot manipulator. The comparison is focused on some points for both algorithms like the accuracy of the results and the speed of convergence. Different target points have been taken to check the performan...

A hyper-heuristic for the one dimensional bin packing problem is presented that uses an Evolutionary Algorithm (EA) to evolve a set of attributes that characterise a problem instance. The EA evolves divisions of variable quantity and dimension that represent ranges of a bin’s capacity and are used to train a k-nearest neighbour algorithm. Once trained the classifier selects a single determinist...

We review Galilean Electromagnetism since the 1973 seminal paper of Jean-Marc Lévy-Leblond and Michel Le Bellac and we explain for the first time all the historical experiments of Rowland, Vasilescu Karpen, Roentgen, Eichenwald, Wilson, Wilson and Wilson, which were previously interpreted in a Special Relativistic framework by showing the uselessness of the latter for setups involving slow moti...

Our research began by studying the Perfect Simulation idea developed by Propp and Wilson. In Article 1 we present the “One-Shot CFTP” framework, a general Perfect Simulation algorithm that constructs a Markov chain with a given target density as its equilibrium density and then carries out Perfect Simulation on this chain. The method is based on the Read-Once CFTP idea of Wilson and the Gibbs s...