![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Generalized Low-Computational Cost Laplacian Eigenmaps
Dimensionality reduction (DR) is a methodology used in many fields linked to data processing, and may represent a preprocessing stage or be an essential element for the representation and classification of dat...
-
Reference Work Entry In depth
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach
-
Reference Work Entry In depth
Layout Decomposition for Multiple Patterning
-
Living Reference Work Entry In depth
Layout Decomposition for Multiple Patterning
-
Living Reference Work Entry In depth
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach
-
Article
The Hahn Quantum Variational Calculus
We introduce the Hahn quantum variational calculus. Necessary and sufficient optimality conditions for the basic, isoperimetric, and Hahn quantum Lagrange problems, are studied. We also show the validity of Le...
-
Article
Avoidance Control on Time Scales
We consider dynamic systems on time scales under the control of two agents. One of the agents desires to keep the state of the system out of a given set regardless of the other agent’s actions. Leitmann’s avoi...
-
Chapter and Conference Paper
Some Traditional Mathematical Knowledge Management
What is mathematical knowledge and how can it be managed? There are not only differing views around on the management aspect but there is no real clarity or consensus on what mathematical knowledge is; indeed ...
-
Article
Computational Approach to Essential and Nonessential Objective Functions in Linear Multicriteria Optimization
The question of obtaining well-defined criteria for multiple-criteria decision making problems is well known. One of the approaches dealing with this question is the concept of nonessential objective functions...
-
Article
Contrasting Two Transformation-based Methods for Obtaining Absolute Extrema
In this note, we contrast two transformation-based methods to deduce absolute extrema and the corresponding extremizers. Unlike variation-based methods, the transformation-based methods of Carlson and Leitman...
-
Reference Work Entry In depth
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach
-
Article
Necessary Optimality Conditions for a Dead Oil Isotherm Optimal Control Problem
We study a system of nonlinear partial differential equations resulting from the traditional modelling of oil engineering within the framework of the mechanics of a continuous medium. Recent results on the pr...
-
Article
Second-Order Optimality Conditions for Constrained Domain Optimization
This paper develops boundary integral representation formulas for the second variations of cost functionals for elliptic domain optimization problems. From the collection of all Lipschitz domains Ω which sati...
-
Chapter
Efficient Network Flow Based Min-Cut Balanced Partitioning
We consider the problem of bipartitioning a circuit into two balanced components that minimizes the number of crossing nets. Previously, Kernighan and Lin type (K&L) heuristics, simulated annealing approach, a...
-
Article
VLSI Circuit Performance Optimization by Geometric Programming
Delay of VLSI circuit components can be controlled by varying their sizes. In other words, performance of VLSI circuits can be optimized by changing the sizes of the circuit components. In this paper, we defin...
-
Chapter
Integrated Floorplanning and Interconnect Planning
When VLSI technology enters the deep sub-micron era, communication between different components is significantly increased. Interconnect delay also becomes the dominant factor in total circuit delay. All these...
-
Chapter and Conference Paper
Behavioural Analysis Methodology Oriented to Configuration of Parallel, Real-Time and Embedded Systems
This paper describes a methodology suitable for behavioural analysis of parallel real-time and embedded systems. The main goal of the methodology is to achieve a proper configuration of the system in order to ...
-
Article
A review of Goal Programming and its applications
This paper presents a review of the current literature on the branch of multi-criteria decision modelling known as Goal Programming (GP). The result of our indepth investigations of the two main GP methods, le...
-
Article
Network reliability and the probabilistic estimation of damage from fire spread
An efficient generalization of Shanthikumar's upper bound on two-terminal reliability is developed, that leads to efficient methods for the probabilistic assessment of damage from fire spread and other invasiv...
-
Chapter
Computational Methods For Linear Programming
The paper examines two methods for the solution of linear programming problems, the simplex method and interior point methods derived from logarithmic barrier methods. Recent improvements to the simplex algori...