Describing Minimax The key to the Minimax algorithm is a back and forth between the two players, where the player whose "turn it is" desires to pick the move with the maximum score. In turn, the ...

In this paper, we propose an algorithm for solving inequality constrained mini-max optimization problem. In this algorithm, an active set strategy is used together with multiplier method to convert ...

This is a preview. Log in through your library . Oxford University Press is a department of the University of Oxford. It furthers the University's objective of excellence in research, scholarship, and ...

Abstract: This paper presents a moving window min-max (MWMM) algorithm-based control of a unified power quality conditioner (UPQC) located at an electric vehicle (EV) charging station. In UPQC, series ...

Abstract: The game of chess has been long used for benchmarking algorithms. It is because of the unique combination of intuition, intelligence and memory required to win a game of chess. Therefore, ...