We give a polynomial time algorithm for computing the Igusa local zeta function Z(s, f) attached to a polynomial f (x) ∈ Z[x], in one variable, with splitting field Q, and a prime number p. We also propose a new class of Linear Feedback Shift Registers based on the computation of Igusa's local zeta function.

For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f ∈ R that avoids a direct computation of Rf as a D-module. Based on this approach, we develop an algorithm for computing the characteristic cycle of the local cohomology modules H I (R) for any ideal I ⊆ R using the Čech complex. The algorithm, in ...

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

Local polynomial regression (Fan & Gijbels, 1996) is an important class of methods for nonparametric density estimation and regression problems. However, straightforward implementation of local polynomial regression has quadratic time complexity which hinders its applicability in large-scale data analysis. In this paper, we significantly accelerate the computation of local polynomial estimates ...

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V,E), with local rewards r : E → Z, and three types of positions: black VB , white VW , and random VR forming a partition of V . It is a long-standing open question whether a polynomial time algorithm for BWR-games exists, even when |VR| = 0. In fact, a pseudo-polynomial ...

the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...