Search
Search Results
-
Analysis of 2PADCL Energy Recovery Logic for Ultra Low Power VLSI Design for SOC and Embedded Applications
Here in this scope we have proposed a noble adiabatic dynamic CMOS logic circuit known as two phase adiabatic dynamic logic. The proposed two 2 phase...
-
A survey on book-embedding of planar graphs
The book-embedding problem arises in several area, such as very large scale integration (VLSI) design and routing multilayer printed circuit boards...
-
An adaptive large neighbourhood search algorithm for diameter bounded network design problems
This paper focuses on designing a diameter - constrained network where the maximum distance between any pair of nodes is bounded. The objective...
-
Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm
Graph partitioning is a classical NP problem. The goal of graphing partition is to have as few cut edges in the graph as possible. Meanwhile, the...
-
Faster goal-oriented shortest path search for bulk and incremental detailed routing
We develop new algorithmic techniques for VLSI detailed routing. First, we improve the goal-oriented version of Dijkstra’s algorithm to find shortest...
-
Approximating the discrete time-cost tradeoff problem with bounded depth
We revisit the deadline version of the discrete time-cost tradeoff problem for the special case of bounded depth. Such instances occur for example in...
-
Embedding Augmented Cubes into Grid Networks for Minimum Wirelength
Deriving an effective VLSI layout for interconnected network is important, since it increases the cost-effectiveness of parallel architectures. Graph...
-
Evolutionary Optimisation of a Flexible-Launcher Simple Adaptive Control System
Attitude control of conventional launchers is relatively easy and straightforward and gives an adequate performance when applied to the nominal...
-
Approximate Evaluation of the Efficiency of Synchronous and Self-Timed Methodologies in Problems of Designing Failure-Tolerant Computing and Control Systems
AbstractThe paper deals with a comparative analysis of the efficiency of using synchronous and self-timed (ST) methodologies in the design of...
-
Using Euler’s Formula to Find the Lower Bound of the Page Number
The concept of book embedding, originating in computer science, has found extensive applications in various problem domains. A book embedding of a...
-
Statistical static timing analysis via modern optimization lens: I. Histogram-based approach
Statistical Static Timing Analysis (SSTA) is studied from the point of view of mathematical optimization. We present two formulations of the problem...
-
A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application
Metaheuristics are a class of approximate methods, which are designed to attack hard combinatorial optimization problems. In metaheuristics, a...
-
An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
In this paper, we consider the group prize-collecting Steiner tree problem with submodular penalties (GPCST-SP problem). In this problem, we are...
-
Characterization of the Imbalance Problem on Complete Bipartite Graphs
We study the imbalance problem on complete bipartite graphs. The imbalance problem is a graph layout problem and is known to be NP-complete. Graph...
-
How to approximate the Dirac equation with the Mauser method
Mauser and coworkers discussed in a series of papers an ansatz how to split the Dirac equation and the wave function appearing therein into a part...
-
Implications, conflicts, and reductions for Steiner trees
The Steiner tree problem in graphs (SPG) is one of the most studied problems in combinatorial optimization. In the past 10 years, there have been...
-
-
Optimization and Solution Approaches in Utilizing Wireless Sensor Networks for Exploring Moon, Planets, and Space
The technological improvements in small electromechanical systems and wireless communication technologies have provided an opportunity to use...
-
Clustering without replication in combinatorial circuits
The modern integrated circuit is one of the most complex products engineered to date. It continues to grow in complexity as years progress. As a...
-
