ITERATIVE ESTIMATION ALGORITHMDUALITYCENTERSThis paper constructs an interval partition linearization algorithm for solving minimax linear fractional programming (MLFP) problem. In this algorithm, MLFP is converted and decomposed into a series of linear programs by dividing the outer 1-dimensional space of...
Design A Chess Movement Algorithm and Detect the Movement by Images Classification Using Support Vector Machine Classifier* Image processing method combined with SVM (support vector machine) model was used to improve the detection of the chess moves. A computer vision program ... NLT Tra,PT Cong,...
The code compiles and works. But it performs poorly. The AI takes the first legal move found. You would have to re-implement the function best_move() (in file FiveLogic.java) to include minimax and a reasonable evaluation function. You can add methods and call them withing best_move()....
It uses the Minimax algorithm with alpha-beta pruning to figure out the best moves to play against its opponent. Prerequisites g++ Compiler Java and the Java SE Development Kit GNU Make Why C++ AND Java? This program was originally meant to be written in Java, however, an individual who ...
In this paper, a heuristic fuzzy reasoning based algorithm is applied to the multipurpose reconfiguration of medium voltage distribution systems. Five obje... A Ebrahimi,S Mohseni - IET 被引量: 11发表: 2001年 Comparative Evaluation of Multipurpose Reservoir Operating Rules Using Multicriterion Deci...
Research on balance of mixed-model assembly line workstations based on genetic algorithm The present assembly line balancing methods lack associativity,systematic features and integrity and fail to take into consideration of the problems such a... WS Ling - 《Journal of Hefei University of Technology...
#include <cstdio>#include<cmath>#include<algorithm>usingnamespacestd;constintMAXN=1005;constintINF=0x3f3f3f3f;structNode{intx,y; }stone[MAXN];intn;doublemp[MAXN][MAXN];doubledist(intx1,inty1,intx2,inty2) {returnsqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)); ...
This paper puts forward a novel affine relaxation-based algorithm for solving the minimax affine fractional program problem (MAFPP) over a polyhedron set. First of all, some new variables are introduced for deriving the equivalence problem (EP) of the MAFPP. Then, for the EP, the affine ...
This paper presents a Turbo-Basic program that implements a revised version of a new algorithm for the fast and optimum solution of the general linear minimax approximation problem. The algorithm proceeds iteratively and terminates when the global minimum value of the objective function is reached. ...
Turbo-Basic program for IBM-PC ATThis paper presents a Turbo-Basic program that implements an algorithm for the optimum approximation of real rational functions via linear-programming. The formulation of the linear problem is based on the minimization of a minimax criterion, while its solution is ...