Sadiq M. Sait

Learn More
We may not be able to make you love reading, but vlsi physical design automation theory and practice will lead you to love reading starting from now. Book is the window to open the new world. The world that you want is in the better stage and level. World will always guide you to even the prestige stage of the life. You know, this is some of how reading(More)
Description: Iterative Computer Algorithms with Applications in Engineering describes in-depth the five main iterative algorithms for solving hard combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search, Simulated Evolution, and Stochastic Evolution. The authors present various iterative techniques and illustrate how they(More)
Open shortest path first (OSPF) is a routing protocol which is widely used in the industry. Its functionality mainly depends on the weights assigned to the links. Given the traffic demands on a network, setting weights such that congestion can be avoided is an NP-hard problem. Optimizing these link weights leads to efficient network utilization which is the(More)
Setting weights for Open Shortest Path First (OSPF) routing protocol is an NP-hard problem. Optimizing these weights leads to less congestion in the network while utilizing link capacities efficiently. In this paper, Simulated Evolution (SimE), a non-deterministic iterative heuristic, is engineered to solve this problem. A cost function that depends on the(More)
Evolutionary algorithms, simulated annealing (SA), and tabu search (TS) are general iterative algorithms for combinatorial optimization. The term evolutionary algorithm is used to refer to any probabilistic algorithm whose design is inspired by evolutionary mechanisms found in biological species. Most widely known algorithms of this category are genetic(More)
Among one of the most far-reaching influences of the Internet, especially from the perspective of business and market models, is the concept and application of eCommerce. Today, this erstwhile ‘experimental’ commerce model has become a standard platform for streamlining business flows and broadening product outreach. This is validated by the significant(More)
This paper describes a unique approach to scheduling and allocation problem in high-level synthesis using genetic algorithm (GA). This approach is different from a previous attempt using GA [l] in many respects. Our contributions include: a new chromosomal representation for scheduling and two subproblems of allocation; and two novel crossover operators to(More)
State assignment (SA) for finite state machines (FSMs) is one of the main optimization problems in the synthesis of sequential circuits. It determines the complexity of its combinational circuit and thus area, delay, testability and power dissipation of its implementation. Particle swarm optimization (PSO) is a nondeterministic heuristic that optimizes a(More)
Cloud computing is a rapidly growing services business in today’s IT market. Its sharp growth is producing many challenges for cloud managers. One primary concern is to efficiently manage the cloud resources, i.e., to maximize utilization of hardware with minimum power consumption. Virtual Machine (VM) consolidation is a very helpful approach to achieve(More)