Search results for "ALGORITHM"
showing 10 items of 4887 documents
A Predictive Approach for the Efficient Distribution of Agent-Based Systems on a Hybrid-Cloud
2018
International audience; Hybrid clouds are increasingly used to outsource non-critical applications to public clouds. However, the main challenge within such environments, is to ensure a cost-efficient distribution of the systems between the resources that are on/off premises. For Multi Agent Systems (MAS), this challenge is deepened due to irregular workload progress and intensive communication between the agents, which may result in high computing and data transfer costs. Thus, in this paper we propose a generic framework for adaptive cost-efficient deployment of MAS with a special focus on hybrid clouds. The framework is based mainly on the use of a performance evaluation process that con…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
Assessment of the Current for a Non-Linear Power Inductor Including Temperature in DC-DC Converters
2023
A method for estimating the current flowing through a non-linear power inductor operating in a DC/DC converter is proposed. The knowledge of such current, that cannot be calculated in closed form as for the linear inductor, is crucial for the design of the converter. The proposed method is based on a third-order polynomial model of the inductor, already developed by the authors; it is exploited to solve the differential equation of the inductor and to implement a flux model in a circuit simulator. The method allows the estimation of the current up to saturation, intended as the point at which the differential inductance is reduced to half of its maximum value. The current profile depends al…
On the Quantum and Classical Complexity of Solving Subtraction Games
2019
We study algorithms for solving Subtraction games, which are sometimes referred as one-heap Nim games.
Computational Complexity and Communication: Coordination in Two-Player Games
2002
The main contribution of this paper is the development and application of cryptographic techniques to the design of strategic communication mechanisms. One of the main assumptions in cryptography is the limitation of the computational power available to agents. We introduce the concept of limited computational complexity, and by borrowing results from cryptography, we construct a communication protocol to establish that every correlated equilibrium of a two-person game with rational payoffs can be achieved by means of computationally restricted unmediated communication. This result provides an example in game theory where limitations of computational abilities of players are helpful in solv…
Efficient Parallel Nash Genetic Algorithm for Solving Inverse Problems in Structural Engineering
2015
A parallel implementation of a game-theory based Nash Genetic Algorithm (Nash-GAs) is presented in this paper for solving reconstruction inverse problems in structural engineering. We compare it with the standard panmictic genetic algorithm in a HPC environment with up to eight processors. The procedure performance is evaluated on a fifty-five bar sized test case of discrete real cross-section types structural frame. Numerical results obtained on this application show a significant achieved increase of performance using the parallel Nash-GAs approach compared to the standard GAs or Parallel GAs.
Quantum-over-Classical Advantage in Solving Multiplayer Games
2020
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games.
Memory limited inductive inference machines
1992
The traditional model of learning in the limit is restricted so as to allow the learning machines only a fixed, finite amount of memory to store input and other data. A class of recursive functions is presented that cannot be learned deterministically by any such machine, but can be learned by a memory limited probabilistic leaning machine with probability 1.
Organized Learning Models (Pursuer Control Optimisation)
1982
Abstract The concept of Organized Learning is defined, and some random models are presented. For Not Transferable Learning, it is necessary to start from an instantaneous learning; by a discrete way, we must form a stochastic model considering the probability of each path; with a continue aproximation, we can study the evolution of the internal state through to consider the relative and absolute probabilities, by means of differential equations systems. For Transferable Learning, the instantaneous learning give us directly the System evolution. So, the Algoritmes for the different models are compared.
SVM approximation for real-time image segmentation by using an improved hyperrectangles-based method
2003
A real-time implementation of an approximation of the support vector machine (SVM) decision rule is proposed. This method is based on an improvement of a supervised classification method using hyperrectangles, which is useful for real-time image segmentation. The final decision combines the accuracy of the SVM learning algorithm and the speed of a hyperrectangles-based method. We review the principles of the classification methods and we evaluate the hardware implementation cost of each method. We present the combination algorithm, which consists of rejecting ambiguities in the learning set using SVM decision, before using the learning step of the hyperrectangles-based method. We present re…