The concept of comprehensive Grobner bases was introduced by Weispfenning. Montes has proposed an efficient algorithm for computing these bases. But he has not explicitly used Buchberger's criteria in his algorithm. In this paper we prove that we can apply these criteria on Montes algorithm. We propose a modified version of Montes algorithm and evaluate its performance via some examples.

This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...

The detection of genetically modified (GM) materials in food and feed products is a complex multi-step analytical process invoking screening, identification, and often quantification of the genetically modified organisms (GMO) present in a sample. "Combinatory qPCR SYBRGreen screening" (CoSYPS) is a matrix-based approach for determining the presence of GM plant materials in products. The CoSYPS...

in wireless sensor networks (wsns), localization algorithms could be range-based or range-free. the approximate point in triangle (apit) is a range-free approach. we propose modification of the apit algorithm and refer as modified-apit. we select suitable triangles with appropriate distance between anchors to reduce pit test errors (edge effect and non-uniform placement of neighbours) in apit a...

Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on set-membership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performa...

the multiple traveling salesman problem (mtsp) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. the objective is to minimize the total distance traveled by all the salesmen. the mtsp is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. in this paper,...