• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 375,640
Next 10 →

Cross-Dual on The Golden Optimum Solutions

by Seiichi Iwamoto
"... This paper owes its origin to two simple minimization problems. One is a shortest distance problem on the plane. The other is a ratio minimization problem over the unit interval. We associates each of two minimization problems with a counterpart “maximiza-tion problem. Thus we consider two couples o ..."
Abstract - Add to MetaCart
quadratic constraint. An optimum solution – optimum point and optimum value – is called Golden if both the slope and the op-timum value constitute the Golden ratio. We show two interesting features. One is the Golden optimum solution. All six problems have the Golden optimum slutions. The other is a cross

OPTIMUM SOLUTIONS FOR GROWER-FINISHER PIGS

by Neil S. Ferguson, Nutreco Canada Agresearch
"... Dynamic integrated models, such as Watson®, are available and being used to improve performance and profitability of finishing pigs by enhancing the decision-making process. One of the main purposes of an integrated management approach is to bring together the complex interactions between the animal ..."
Abstract - Add to MetaCart
of these changes; and therefore, 3) the optimum nutritional and/or financial strategy. It is important to note that optimum solutions are farm-specific and no one solution fits all because of the inherent differences in production characteristics on each farm (e.g health status, genetics, housing, ingredient

Monopolistic competition and optimum product diversity

by Avinash K. Dixit, Joseph E. Stiglitz - AMERICAN ECONOMIC REVIEW , 1977
"... ..."
Abstract - Cited by 1864 (5 self) - Add to MetaCart
Abstract not found

The Advantages of Evolutionary Computation

by David B. Fogel , 1997
"... Evolutionary computation is becoming common in the solution of difficult, realworld problems in industry, medicine, and defense. This paper reviews some of the practical advantages to using evolutionary algorithms as compared with classic methods of optimization or artificial intelligence. Specific ..."
Abstract - Cited by 536 (6 self) - Add to MetaCart
advantages include the flexibility of the procedures, as well as the ability to self-adapt the search for optimum solutions on the fly. As desktop computers increase in speed, the application of evolutionary algorithms will become routine. 1 Introduction Darwinian evolution is intrinsically a robust search

Obtaining exact solution from a near optimum solution for convex QP

by Shinji Mizuno, Katta G. Murty
"... Consider a convex quadratic program of size L involving m inequality constraints and possibly some equality constraints in n variables. Given a feasible solution whose objective value is within 2 \Gamma2L of the optimum objective value, we discuss a technique that finds a true optimum solution in ..."
Abstract - Add to MetaCart
Consider a convex quadratic program of size L involving m inequality constraints and possibly some equality constraints in n variables. Given a feasible solution whose objective value is within 2 \Gamma2L of the optimum objective value, we discuss a technique that finds a true optimum solution

For Most Large Underdetermined Systems of Linear Equations the Minimal ℓ1-norm Solution is also the Sparsest Solution

by David L. Donoho - Comm. Pure Appl. Math , 2004
"... We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that ..."
Abstract - Cited by 560 (10 self) - Add to MetaCart
that for large n, and for all Φ’s except a negligible fraction, the following property holds: For every y having a representation y = Φα0 by a coefficient vector α0 ∈ R m with fewer than ρ · n nonzeros, the solution α1 of the ℓ 1 minimization problem min �x�1 subject to Φα = y is unique and equal to α0

Closed-form solution of absolute orientation using unit quaternions

by Berthold K. P. Horn - J. Opt. Soc. Am. A , 1987
"... Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closed-form solution to the least-squares pr ..."
Abstract - Cited by 973 (4 self) - Add to MetaCart
Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closed-form solution to the least

Finding globally optimum solutions in antenna optimization problems

by Aydin Babakhani, Javad Lavaei, John C. Doyle, Ali Hajimiri - IEEE International Symposium on Antennas and Propagation , 2010
"... During the last decade, the unprecedented increase in the affordable computational power has strongly supported the development of optimization techniques for designing antennas. Among these techniques, genetic algorithm [1] and particle swarm optimization [2] could be mentioned. Most of these techn ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
During the last decade, the unprecedented increase in the affordable computational power has strongly supported the development of optimization techniques for designing antennas. Among these techniques, genetic algorithm [1] and particle swarm optimization [2] could be mentioned. Most of these techniques use physical dimensions of an antenna

A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge

by Thomas K Landauer, Susan T. Dutnais - PSYCHOLOGICAL REVIEW , 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract - Cited by 1772 (10 self) - Add to MetaCart
How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LSA), is presented and used to successfully simulate such learning and several other psycholinguistic phenomena. By inducing global knowledge indirectly from local co-occurrence data in a large body of representative text, LSA acquired knowledge about the full vocabulary of English at a comparable rate to schoolchildren. LSA uses no prior linguistic or perceptual similarity knowledge; it is based solely on a general mathematical learning method that achieves powerful inductive effects by extracting the right number of dimensions (e.g., 300) to represent objects and contexts. Relations to other theories, phenomena, and problems are sketched.

OPTIMUM SOLUTION EXPECTATION ON SUMATRA ELECTRICITY EXPANSION PLANNING

by Edwaren Liun
"... ..."
Abstract - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 375,640
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University