Search results for "Algorithm"
showing 10 items of 4887 documents
Generation of Hardware/Software systems based on CAL dataflow description
2011
International audience; This paper presents a new development of rapid prototyping tools for system design based on data-flow specifications. In this context, the efficiency of tools for the automatic translation from the data-flow programs to C and/or HDL are assessed by means of two design cases. The paper also introduces the new concept of the automatic synthesis of interfaces. Such generic interfaces are implemented by using an embedded microprocessor, which can support a large variety of interfaces already available as native IP libraries in the case of FPGA. The two design cases described here have been developed, tested and validated on different implementation platforms. The results…
Dynamic Economic Load Dispatch using Levenberg Marquardt Algorithm
2018
Abstract Economic Load Dispatch (ELD) is a very important feature of power system network. This work proposes the novel approach which considers the constraint of ramp rate limit (RRL) to solve the ELD problem. It build up the time varying dynamic economic load dispatch in which load dispatching is calculated for each specified time interval, first it is tested with conventional lambda iteration technique and then the outcomes are used to train artificial neural network (ANN) it is based on Levenberg Marquardt algorithm (LMA).As compared with any other ANN method, the Levenberg Marquardt algorithm based dynamic economic load dispatch is more swift and precise. The propose algorithm is teste…
Looking for the best modes helps solving the MRCPSP/max
2013
The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags MRCPSP/max is a very general project scheduling problem with multiple execution modes per activity, renewable and non-renewable resources and minimum and maximum time lags between activities. In this paper, we describe SA-EVA, an algorithm for the problem. SA-EVA first searches for the best mode for each activity, without considering renewable resources. In this phase a simulated annealing is applied. Once a mode vector has been chosen, the problem reduces to the RCPSP/max, which SA-EVA solves with EVA, an algorithm designed in Ballestin et al. [2009. An evolutionary algorithm for the resource-…
Approximation algorithm for constrained coupled-tasks scheduling problem
2014
International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.
An approximate/exact objective based search technique for solving general scheduling problems
2018
Abstract In this paper, we analyze single machine scheduling problems under the following minimization objectives: the maximum completion time (makespan), the total completion time and the maximum lateness, including fundamental practical aspects, which often occur in industrial or manufacturing reality: release dates, due dates, setup times, precedence constraints, deterioration (aging) of machines, as well as maintenance activities. To solve the problems, we propose an efficient representation of a solution and a fast neighborhood search technique, which calculates an approximation of criterion values in a constant time per solution in a neighborhood. On this basis, a novel approximate/ex…
Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres
2012
Abstract In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowi…
Shifting of wrapped phase maps in the frequency domain using a rational number
2016
The number of phase wraps in an image can be either reduced, or completely eliminated, by transforming the image into the frequency domain using a Fourier transform, and then shifting the spectrum towards the origin. After this, the spectrum is transformed back to the spatial domain using the inverse Fourier transform and finally the phase is extracted using the arctangent function. However, it is a common concern that the spectrum can be shifted only by an integer number, meaning that the phase wrap reduction is often not optimal. In this paper we propose an algorithm than enables the spectrum to be frequency shifted by a rational number. The principle of the proposed method is confirmed b…
CAMLearn : a semantic context-aware recommender system architecture : application on m-learning domain
2015
Given the rapid emergence of new mobile technologies and the growth of needs of a moving society in training, works are increasing to identify new relevant educational platforms to improve distant learning. The next step in distance learning is porting e-learning to mobile systems. This is called m-learning. So far, learning environment was either defined by an educational setting, or imposed by the educational content. In our approach, in m-learning, we change the paradigm where the system recommends content and adapts learning follow to learner's context.
Online topology estimation for vector autoregressive processes in data networks
2017
An important problem in data sciences pertains to inferring causal interactions among a collection of time series. Upon modeling these as a vector autoregressive (VAR) process, this paper deals with estimating the model parameters to identify the underlying causality graph. To exploit the sparse connectivity of causality graphs, the proposed estimators minimize a group-Lasso regularized functional. To cope with real-time applications, big data setups, and possibly time-varying topologies, two online algorithms are presented to recover the sparse coefficients when observations are received sequentially. The proposed algorithms are inspired by the classic recursive least squares (RLS) algorit…
Non-linear RLS-based algorithm for pattern classification
2006
A new non-linear recursive least squares (RLS) algorithm is presented in the context of pattern classification problems. The algorithm incorporates the non-linearity of the filter's output in the updating rules of the classical RLS algorithm. The proposed method yields lower stationary error levels when compared to the standard LMS and RLS algorithms in a classical application of pattern classification, such as the channel equalization problem.