Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,928,871 papers from all fields of science
Search
Sign In
Create Free Account
Posynomial
Known as:
Posynomials
A posynomial, also known as a posinomial in some literature, is a function of the form where all the coordinates and coefficients are positive real…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Geometric programming
List of numerical analysis topics
Polynomial
Signomial
Broader (1)
Mathematical optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Multi-Objective Geometric Programming Problem Being Cost Coefficients as Continous Function with Weighted Mean Method
A. K. Ojha
,
A. K. Das
arXiv.org
2010
Corpus ID: 6816963
Geometric programming problems occur frequently in engineering design and management. In multiobjective optimization, the trade…
Expand
2010
2010
Multi-objective Geometric Programming Problem With Weighted Mean Method
A. K. Ojha
,
K. K. Biswal
arXiv.org
2010
Corpus ID: 12800193
Geometric programming is an important class of optimization problems that enable practitioners to model a large variety of real…
Expand
2010
2010
Posynomial Geometric Programming Problems with Multiple Parameters
A. K. Ojha
,
K. K. Biswal
arXiv.org
2010
Corpus ID: 12370569
Abstract — Geometric programming problem is a powerful tool for solving some special type non-linear programming problems. It has…
Expand
2005
2005
Optimal doping profiles via geometric programming
S. Joshi
,
Stephen P. Boyd
,
R. Dutton
IEEE Transactions on Electron Devices
2005
Corpus ID: 15069344
We first consider the problem of determining the doping profile that minimizes base transit time in a (homojunction) bipolar…
Expand
2005
2005
Medium Access Control and Adaptive Transmission Techniques in Wireless Networks
A. Muqattash
2005
Corpus ID: 46320374
Efficient utilization of the limited wireless spectrum while satisfying applications' quality of service requirements is an…
Expand
2004
2004
LARTTE : A Posynomial-Based Lagrangian Relaxation Tuning Tool for Fast and Effective Gate-Sizing and Multiple V t Assignment
H. Chou
,
Yu-Hao Wang
,
C. C. Chen
2004
Corpus ID: 6927946
In this paper, we propose a novel method for fast and effective gate-sizing and multipleVt assignment using Lagrangian Relaxation…
Expand
2003
2003
A fanout optimization algorithm based on the effort delay model
P. Rezvani
,
Massoud Pedram
IEEE Trans. Comput. Aided Des. Integr. Circuits…
2003
Corpus ID: 7026536
This paper presents a Logical Effort-based fanout OPtimizer for ARea and Delay (LEOPARD), which relies on the availability of a…
Expand
2000
2000
Simultaneous gate sizing and placement
Wei Chen
,
Cheng-Ta Hsieh
,
Massoud Pedram
IEEE Trans. Comput. Aided Des. Integr. Circuits…
2000
Corpus ID: 2753220
This paper presents an iterative optimization technique for improving delay in integrated circuits. The basic idea is to perform…
Expand
1999
1999
Gate sizing with controlled displacement
Wei Chen
,
Cheng-Ta Hsieh
,
Massoud Pedram
ACM International Symposium on Physical Design
1999
Corpus ID: 14426129
In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use…
Expand
1987
1987
Delay Optimization of Combinational Static CMOS Logic
M. Hofmann
,
J. K. Kim
24th ACM/IEEE Design Automation Conference
1987
Corpus ID: 14782511
Several methods for increasing the speed of combinational static CMOS circuits, including techniques for partitioning gates on…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE