نتایج جستجو برای: geometric programming

تعداد نتایج: 414026  

Journal: :CoRR 2017
Juncai Xu Zhenzhong Shen Qingwen Ren Xin Xie Zhengyu Yang

Genetic programming has been widely used in the engineering field. Compared with the conventional genetic programming and artificial neural network, geometric semantic genetic programming (GSGP) is superior in astringency and computing efficiency. In this paper, GSGP is adopted for the classification and regression analysis of a sample dataset. Furthermore, a model for slope stability analysis ...

Journal: :Transactions of the Society of Instrument and Control Engineers 1990

Journal: :CoRR 2009
A. K. Ojha K. K. Biswal

A Geometric programming (GP) is a type of mathematical problem characterized by objective and constraint functions that have a special form. Many methods have been developed to solve large scale engineering design GP problems. In this paper GP technique has been used to solve multi-objective GP problem as a vector optimization problem. The duality theory for lexicographic geometric programming ...

2009
Lucanus Simonson Gyuszi Suto

There is a proliferation of geometric algorithms and data types with no existing mechanism to unify geometric programming in C++. The geometry template library (GTL) provides geometry concepts and concept mapping through traits as well as algorithms parameterized by conceptual geometric data type to provide a unified library of fundamental geometric algorithms that is interoperable with existin...

1997
Stephen Mann Nathan Litke Tony DeRose

An algebra for geometric reasoning is developed that is amenable to software implementation. The features of the algebra are chosen to support geometric programming of the variety found in computer graphics and computer aided geometric design applications. The implementation of the algebra in C++ is described, and several examples illustrating the use of this software are given.

Journal: :Operations Research 2005
Stephen P. Boyd Seung-Jean Kim Dinesh Patil Mark Horowitz

This paper concerns a method for digital circuit optimization based on formulating the problem as a geometric program (GP) or generalized geometric program (GGP), which can be transformed to a convex optimization problem and then very efficiently solved. We start with a basic gate scaling problem, with delay modeled as a simple resistor-capacitor (RC) time constant, and then add various layers ...

2006
Omid Banyasad

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii List of Abbreviations Used . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .xiii Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .xiv CHAPTER 1: Introduction . . . . . . . . . . . . . . . . . . ....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید