We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
Jean Berstel, Luc Boasson, Olivier Carton, Bruno P...
Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achie...
Abstract. This paper proposes an algorithm for combinatorial optimizations that uses reinforcement learning and estimation of joint probability distribution of promising solutions ...