this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...

If P is a hereditary property then we show that, for the existence of a perfect f -factor, P is a sufficient condition for countable graphs and yields a sufficient condition for graphs of size א1. Further we give two examples of a hereditary property which is even necessary for the existence of a perfect f -factor. We also discuss the א2-case. We consider graphs G = (V,E), where V = V (G) is a ...

We study a generalized version of the index calculus method for the discrete logarithm problem in Fq , when q = pn, p is a small prime and n→∞. The database consists of the logarithms of all irreducible polynomials of degree between given bounds; the original version of the algorithm uses lower bound equal to one. We show theoretically that the algorithm has the same asymptotic running time as ...

Some recursive function techniques for describing large-scale compositional state machines encountered in computer engineering.

Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...