Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “program optimization”
Bandler, John W., Rizoniko-Popovic, Jadranka · MacSphere (McMaster University) · 1973
Report and program package produced by John W. Bandler and Jadranka Rizoniko-Popovic. Program package is written in FORTRAN IV. This work is licensed under a Creative Commons Attribution-Non-Commercial-No-Derivatives 4.0 International License.
Cited by 0
D. J. Packard, Alan B. Macnee · Deep Blue (University of Michigan) · 1971
http://deepblue.lib.umich.edu/bitstream/2027.42/6963/5/bad0824.0001.001.pdf
Cited by 0Open access
C. A. C. Silva, Marco L. Bittencourt · Structural and Multidisciplinary Optimization · 2000
Cited by 12
Anke Rieger, Volker Klingspor · 1999
Cited by 2
Annette Langer‐Gould, Stephen C. Cheng, Bonnie H. Li et al. · Annals of Clinical and Translational Neurology · 2021
The causes of wasteful spending on MS DMTs are complex and require multiple strategies to resolve. We provide herein granular details of how we designed and implemented our health system intervention to facilitate its adaption to other settings and conditions.
Cited by 12Open access
Giustino Peca · Elsevier eBooks · 1982
Cited by 0
Tianqi Chen, Siyuan Feng, Bohan Hou et al. · 2022
Cited by 0
Shen Wang, Ziqi Song, Mahdi Mehrtash et al. · SoftwareX · 2024
In this paper, we present a novel open-source electricity systems optimization tool, the Holistic Optimization Program for Electricity (HOPE), to assess emerging generation technology, inform policy design, and support planning. With a highly transparent, interpretable, and compact model design, HOPE easily allows user access and modification, serving its main goal to benefit users beyond engineer communities and facilitate collaboration across the science-policy boundary. By activating different modes, the current version of HOPE (v1.0) offers flexibility in serving as either a Generation and Transmission Expansion Planning tool (GTEP) or a Production Cost Modelling tool (PCM). It includes modelling features such as long-term resource investments, short-term system operations, and a detailed representation of policies across various levels of regulated institutions. This paper outlines the building blocks of the model and its software structure. Case study results from using HOPE for the state of Maryland as well as the Pennsylvania-New Jersey-Maryland (PJM) footprint are also provided.
Cited by 1Open access
Aydin Ünlü · SHILAP Revista de lepidopterología · 2017
The human hand is constantly in contact with products. In particular, the handle of work equipment, as a direct interface to the user, greatly influences the perception of fatigue, pain and comfort. Comfortable handles need right decisions regarding handle design parameters such as shape, size, material and surface. In addition, the designer must consider many factors such as grip types, coupling types and target groups. Ergonomic handle design also generally entails using many subjects for the evaluation of prototypes. This evaluation is purely subjective, and justifiably so, as handle design has a strong subjective element rooted in the communication of comfort as sensation. But thisalso causes high development costs and development times. Research indicates that pressure distribution whilegripping has a major impact on discomfort. The aim is, therefore, to develop a program for grip comfort optimization, based on a digital hand model, taking into consideration influence factors. With this new program, the constructor should already receive information on the CAD model about handle design parameters for the design of comfortable work equipment grips, thus enabling the number of test subjects and expensive prototypes to be reduced. This journal describes a first approach of a program with a coupled multi-body and finite element simulation program (MBS/FEM program). For this, an automatic optimization (AutoDesign)of a shape change handle is simulated and then tested. In the future, a stand-alone program is to be created from this basis.
Cited by 0Open access
Tzu-Han Hung , Jiunn-yeu Chen , Wuu Yang , Wei Chung Hsu · 2010
Today’s compilers have too many optimization options, and it is difficult to understand all the details and the interactions between them. Therefore, many application developers simply use the well-known compiler flags (such as-O2,-Os) to compile all their programs; at the other end of the extreme, some researchers focus on customizing the optimizations for each program. The former method is too naive as it treats all kinds of programs in the same way, and some programs might even have performance loss since the compilation options are in fact tuned for the others. The latter approach takes care of the variations of programs and tries to individually tune them to the best. However, since the optimization space is extremely huge, the scalability of this scheme is a problem and also makes this approach less popular for the emerging dynamic optimizing compilers. We attack this problem by exploiting two insights: first, it is feasible to categorize the programs into different classes according to their functionalities and characteristics; second, dynamic profiling information is useful for recognizing the type of a program. With both insights, we present a novel approach for program optimization: first, the programs are categorized into different classes and the class-level optimization decision is made by the domain experts; then, the class of an input program is recognized by the machine learning models and the optimal class-level optimizations are applied to obtain the best performance. We demonstrate that this approach can be applied to a binary translation/optimization system and great performance improvement can be achieved.
Cited by 0
Angelito Enriquez Malicse · PhilPapers (PhilPapers Foundation)
This document presents a structured program for mind optimization using the analogy of a car navigating roads. Each section of the mind is mapped to a vehicle component, and practical exercises and habits are provided for continuous self-improvement. The program emphasizes adaptive feedback, emotional balance, cognitive enhancement, and goal alignment.
Cited by 0Open access
R. E. Daniel, T. S. Lee · 1986
CELLOPT program developed to assist in designing grid pattern of current-conducting material on photovoltaic cell. Analyzes parasitic resistance losses and shadow loss associated with metallized grid pattern on both round and rectangular solar cells. Though performs sensitivity studies, used primarily to optimize grid design in terms of bus bar and grid lines by minimizing power loss. CELLOPT written in APL.
Cited by 0
D. Strain · NASA Technical Reports Server (NASA) · 1994
New antenna path-length error and pointing-error structure optimization codes were recently added to the MSC/NASTRAN structural analysis computer program. Path-length and pointing errors are important measured of structure-related antenna performance. The path-length and pointing errors are treated as scalar displacements for statics loading cases. These scalar displacements can be subject to constraint during the optimization process. Path-length and pointing-error calculations supplement the other optimization and sensitivity capabilities of NASTRAN. The analysis and design functions were implemented as 'DMAP ALTERs' to the Design Optimization (SOL 200) Solution Sequence of MSC-NASTRAN, Version 67.5.
Cited by 1Open access
Kistler, Thomas, Franz, Michael · 2000
This paper presents a system that provides code generation at load-time and continuous program optimization at run-time. First, the architecture of the system is presented. Then, two optimization techniques are discussed that were developed specifically in the context of continuous optimization. The first of these optimizations continually adjusts the storage layouts of dynamic data structures to maximize data cache locality, while the second performs profile-driven instruction re-scheduling to increase instruction-level parallelism. These two optimizations have very di#erent cost/benefit ratios, presented in a series of benchmarks. The paper concludes with an outlook to future research directions and an enumeration of some remaining research problems. The empirical results presented in this paper make a case in favor of continuous optimization, but indicate that it needs to be applied judiciously. In many situations, the costs of dynamic optimizations outweigh their benefit, so that no break-even point is ever reached. In favorable circumstances, on the other hand, speed-ups of over 120% have been observed. It appears as if the main beneficiaries of continuous optimization are shared libraries, which at di#erent times can be optimized in the context of the currently dominant client application.
Cited by 1
Dong Chun-Li, Zhao Rong-Cai, Ma Zhuo-Jie et al. · 2007
Minimizing communication by increasing the locality of data references is an important optimization for achieving high performance on distributed memory machines. But in the progress of decomposition, reorganization is inevitable. And the communication produced by reorganization is inevitable too. In this paper, the authors present a linear decomposition algorithm that automatically finding computation and data decomposition, including finding data and computations decomposition that has data reorganization communication. And the authors improve the method and reduce the communication cost by merging parallel regions with the same data decomposition.
Cited by 0
Romualdas Tamošaitis · International Multidisciplinary Scientific GeoConference SGEM ... · 2017
Cited by 0
Jie Zhang, Hui Li, Dong Ni et al. · 2019
With the rapid development of mobile Internet, the business volume continues to increase, which puts forward higher requirements for carrying network. As the current mainstream load carrying network scheme, IPRAN network conforms to the load carrying requirements of various services, not only adapting to base station transmission, but also compatible with multi-service comprehensive transmission. Different networking schemes will lead to great differences in cost. How to design the lower cost IPRAN networking scheme rapidly while meeting the business requirements has always been the concern of telecom operators. This paper presents a cost optimization scheme based on IPRAN networking. Based on the actual situation of BBU and RRU distribution in the region to be planned, we designed the access scheme for RRU with the aim of minimizing the sum of lines between BBU and RRU, so as to ensure the lowest line cost. In addition, we propose two constraints, namely, the number of comprehensive service access nodes on each comprehensive service access ring and the number of centralized BBU on each comprehensive service access node. Under the two constraints, we choose the scheme with the lowest equipment cost. Finally, we conducted simulation on the algorithm proposed in this paper, and the results showed that: for IPRAN networks with less than 1000 base stations, this algorithm could select the scheme with the lowest equipment cost from many schemes within 0.7 seconds, and meanwhile give the line design scheme with the least optical fiber loss, providing reference for IPRAN network.
Cited by 1
D'ELIA, DANIELE CONO · Università degli studi di Roma La Sapienza · 2020
Living organisms are adapted to their environment. Modern compilers and runtime systems for computer software are no different: as part of a continuous optimization process, they can adapt the execution cycle of a program to the workload it operates on. This thesis brings novel ideas to the software optimization domain. It illustrates methodological and practical contributions that advance the state of the art for performance profiling techniques and adaptive runtime designs, backed by promising experimental results on industrial-strength benchmarks. Part of the results has been presented in flagship programming language venues.
Cited by 0Open access
A. OSKIN, D. OSKIN · HERALD OF POLOTSK STATE UNIVERSITY Series С FUNDAMENTAL SCIENCES · 2022
One of the numerical optimization methods is considered, which implements the so-called particle swarm method. A modification of the method based on the division of the iterative calculation process into two stages is proposed. To speed up calculations and reduce their complexity. At the first stage, the objective function is replaced by a simplified model, which allows you to quickly determine the approximate area of extremum localization. The final solution is sought in the found localization area, using the original objective function. A console application that implements the algorithm is described and the results of numerical experiments performed using this application are presented.
Cited by 0Open access
J. L. Horsewood · NASA STI Repository (National Aeronautics and Space Administration)
The ASTOP program (an Arbitrary Space Trajectory Optimization Program) designed to generate optimum low-thrust trajectories in an N-body field while satisfying selected hardware and operational constraints is presented. The trajectory is divided into a number of segments or arcs over which the control is held constant. This constant control over each arc is optimized using a parameter optimization scheme based on gradient techniques. A modified Encke formulation of the equations of motion is employed. The program provides a wide range of constraint, end conditions, and performance index options. The basic approach is conducive to future expansion of features such as the incorporation of new constraints and the addition of new end conditions.
Cited by 1Open access