Straight line programs for energy consumption modelling

2019 ◽  
Vol 80 ◽  
pp. 310-328 ◽  
Author(s):  
R. Rueda ◽  
M.P. Cuéllar ◽  
M.C. Pegalajar ◽  
M. Delgado
Keyword(s):  
Energy Consumption ◽  
Straight Line ◽  
Straight Line Programs

scholarly journals A NEW LINEAR GENETIC PROGRAMMING APPROACH BASED ON STRAIGHT LINE PROGRAMS: SOME THEORETICAL AND EXPERIMENTAL ASPECTS

2009 ◽  
Vol 18 (05) ◽  
pp. 757-781 ◽  
Author(s):  
CÉSAR L. ALONSO ◽  
JOSÉ LUIS MONTAÑA ◽  
JORGE PUENTE ◽  
CRUZ ENRIQUE BORGES
Keyword(s):  
Data Structure ◽  
Genetic Programming ◽  
Computer Programs ◽  
Symbolic Regression ◽  
Programming Approach ◽  
Linear Genetic Programming ◽  
Straight Line ◽  
Structured Representations ◽  
Regression Problems ◽  
Straight Line Programs

Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.

On the average-case complexity of underdetermined functions

2018 ◽  
Vol 28 (4) ◽  
pp. 201-221
Author(s):  
Aleksandr V. Chashkin
Keyword(s):  
Boolean Functions ◽  
Correct Order ◽  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity ◽  
Straight Line ◽  
Straight Line Programs

Abstract The average-case complexity of computation of underdetermined functions by straight-line programs with conditional stop over the basis of all at most two-place Boolean functions is considered. Correct order estimates of the average-case complexity of functions with maximum average-case complexity among all underdetermined functions are derived depending on the degree of their determinacy, the size of their domain, and the size of their support.

Energy consumption of three-link manipulators as a function of geometric features and trajectory parameters

Robotica ◽  
1983 ◽  
Vol 1 (2) ◽  
pp. 79-83 ◽  
Author(s):  
A. Klein
Keyword(s):  
Energy Consumption ◽  
Parametric Optimization ◽  
Energy Analysis ◽  
Quality Criterion ◽  
Initial Position ◽  
Velocity Function ◽  
Geometrical Characteristics ◽  
Straight Line ◽  
Dissipation Losses ◽  
Velocity Form

SUMMARYThe method of parametric optimization is applied to the energy analysis of the motion of three-link manipulators. The quality criterion is the energy consumption along 1 m of the path. It consists of two parts: 1) The sum of the products of joint moments and relative joint velocities (an equivalent of the mechanical work); 2) a quadratic form of joint velocities (an analogue of dissipation losses). Typical spatial motions are studied: the hand of the robot moves along a straight line from an initial position to another one, and returns to the start. Several velocity function shapes (parabolic, sinusoidal, and triangular), both symmetric and non-symmetric ones, are considered. The dependence of the energy consumption on the velocity form, on the trajectory parameters and on mechanical and geometrical characteristics of links is discussed.

scholarly journals Aliased register allocation for straight-line programs is NP-complete

2008 ◽  
Vol 407 (1-3) ◽  
pp. 258-273 ◽  
Author(s):  
Jonathan K. Lee ◽  
Jens Palsberg ◽  
Fernando Magno Quintão Pereira
Keyword(s):  
Register Allocation ◽  
Straight Line ◽  
Np Complete ◽  
Straight Line Programs
Sign in / Sign up

Export Citation Format

Share Document