we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...

This paper uses a modified Ant Colony Optimization (ACO) algorithm to price simple financial derivatives. We use ants to find the optimum time to exercise an option. Our algorithm searches the solution space to find optimum solution under some user defined constraints. In this preliminary study we show that the modified ACO works in predicting an optimum exercise time of a simple vanilla option.

An optimum design technique for balanced surface acoustic wave (SAW) filters is proposed. First of all, in order to evaluate the performance of balanced SAW filters by the computer simulation, a numerical model of balanced SAW filters is derived by using mixed-mode scattering parameters. Then the structural design of balanced SAW filters is formulated as a function optimization problem that aim...

Economic load dispatch (ELD) problem between power plant units is formulated as a nonlinear optimization with continuous variables. The main target in this problem is optimum planning in power plant units with minimum cost while equal and non-equal constraints consisting load request and unit production capacity are followed. In this paper an effective method based on particle swarm algorithm o...

This paper is concerned with application and evaluation of ant colony optimization (ACO) method to practical structural optimization problems. In particular, a size optimum design of pin-jointed truss structures is considered with ACO such that the members are chosen from ready sections for minimum weight design. The application of the algorithm is demonstrated using two design examples with pr...

In cloud computing tasks scheduling problem is NP-hard, furthermore it does onerous for attaining an optimum resolution. Extremely quick optimization algorithms are used to proximate the optimum resolution, like ACO (ant colony optimization) algorithm. In cloud computing, in consideration to solve the problem of task scheduling, a period ACO (PACO)-based arranging algorithmic rule has been used...

Abstract In this paper, the design of non-uniform circular antenna arrays of isotropic radiators with optimum side lobe level reduction is investigated. Two global evolutionary optimization methods (namely; the biogeography based optimization and the self-adaptive differential evolution) are used to determine an optimum set of weights and positions that provide a radiation pattern with optimum ...

Asso. Prof.,Dept. of Mech. Engg. G.I.E.T, Rajahmundry, A.P, India DGM (Retd.), B.H.E.L, R&D, Balanagar, Hyderabad, A.P, India Abstract Surface roughness, an indicator of surface quality is one of the most specified customer requirements in a machining process. For efficient use of machine tools, optimum cutting parameters (speed, feed and depth of cut) are required. So it is necessary to find a...

This paper exploits the different properties between the local neighborhood of global optimum and those of local optima in image registration optimization. Namely, a global optimum has a larger capture neighborhood, in which from any location a monotonic path exists to reach this optimum, than any other local optima. With these properties, we propose a simple and computationally efficient techn...

In cognitive radio network model consisting of secondary users and primary users, in order to solve the difficult multi-objective spectrum allocation issue about maximizing network efficiency and users’ fairness to access network, this paper proposes a new discrete multi-objective combinatorial optimization mechanism— HJ-DQPSO based on Hooke Jeeves (HJ) and Quantum Particle Swarm Optimization (...