Estimating and minimizing the maximum power dissipation during testing is an important task in VLSI circuit realization since the power value affects the reliability of the circuits. Therefore during testing a methodology should be adopted to minimize power consumption. Test patterns generated with –D 1 option of ATALANTA contains don’t care bits (x bits). By suitable filling of don’t cares can...

Ant Colony Optimization (ACO) [2] is a nondeterministic algorithm framework that mimics the foraging behavior of ants to solve difficult optimization problems. Several researchers have successfully applied ant based algorithm framework in different fields of engineering, but never in VLSI testing. In this paper, we first describe the basics of ACO. We then consider the problem of simultaneously...

The space-for-time trade-off is one of the earliest to be discovered in computer science. Taking program complexity into account, we can safely call it “space and elegance”for-time trade-off. Contemporary algorithms text books often tackle the complexity problem by first presenting algorithms in an elegant, but inefficient form, followed by a few paragraphs informally describing optimizations. ...

In this paper we introduce a new optimization method for the examinations scheduling problem. Rather than attempting direct optimization of assignments of exams to specific time-slots, we perform permutations of slots and reassignments of exams upon the feasible (but not optimal) schedules obtained by the standard graph colouring method with Largest Degree ordering. The proposed optimization me...

In this article we develop a new approach to duality theory for convex vector optimization problems. We modify a given (set-valued) vector optimization problem such that the image space becomes a complete lattice (a sublattice of the power set of the original image space), where the corresponding infimum and supremum are sets that are related to the set of (minimal and maximal) weakly efficient...

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...