Results 281 to 290 of about 6,493,766 (329)

Discrete Structural Optimization

Journal of the Structural Division, 1981
A new method for solving discrete structural optimization problems is presented. An interior penalty function is used to convert the original constrained problem into an unconstrained parametric problem. Then the search for the optimal solution to the parametric problem is based on a discrete direction gradient. Solving an appropriate sequence of these
Judith S. Liebman, Visarn Chanaratna, Narbey Khachaturian   +2 more
openaire   +1 more source

A novel hybrid method combining electromagnetism-like mechanism and firefly algorithms for constrained design optimization of discrete truss structures

Computers & structures, 2019
A new optimization method called Electromagnetism-like Firefly Algorithm (EFA), which is a novel hybrid between the Electromagnetism-like Algorithm (EM) and the Firefly Algorithm (FA) for discrete structural optimization is proposed. The EFA inherits the
D. Le, Dac-Khuong Bui, T. Ngo, Quoc Hung Nguyen, H. Nguyen-Xuan   +4 more
semanticscholar   +1 more source

Optimal Scaling: Discretization

2012
In clinical trials the research question is often measured with multiple variables, and multiple regression is commonly used for analysis. The problem with multiple regression is that consecutive levels of the variables are assumed to be equal, while in practice this is virtually never true.
Ton J. Cleophas, Aeilko H. Zwinderman
openaire   +1 more source

Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs

Constraints, 2016
Discrete optimization is a central problem in artificial intelligence. The optimization of the aggregated cost of a network of cost functions arises in a variety of problems including Weighted Constraint Programs (WCSPs), Distributed Constraint ...
Ferdinando Fioretto, Enrico Pontelli, W. Yeoh, R. Dechter   +3 more
semanticscholar   +1 more source

Discrete Parameter Optimization

2013
In this chapter, we consider the case when optimization has to be performed over a parameter set that is discrete valued and has a finite number of points. We present adaptations of the SPSA and SF algorithms discussed previously using certain projection mappings. We consider here the case of a long-run average cost objective.
S. Bhatnagar, H. Prasad, L. Prashanth
openaire   +1 more source

Discrete optimal filtering

Discrete Mathematics and Applications, 1998
This paper is about a process \(\{\underline W_i,\;i\in [1:n]\}\) built as follows: \[ \underline W_i= {U_i\brack V_i},\quad 1\leq i\leq n, \] where 1. \(\{U_i,\;i\in [1:n]\}\) is a given (deterministic) unobservable sequence of zeros and ones which contains at least one sequence of zeros and one sequence of ones, both of length \(p\). 2.
Gladkov, B. V., Datsenko-Chigorin, A. N.
openaire   +1 more source

Theory of Evolutionary Computation: Recent Developments in Discrete Optimization

Theory of Evolutionary Computation, 2020
Thomas Bäck, L. Kari, Benjamin Doerr, F. Neumann   +3 more
semanticscholar   +1 more source

Improved arithmetic optimization algorithm and its application to discrete structural optimization

Structures, 2022
A. Kaveh, Kiarash Biabani Hamedani
semanticscholar   +1 more source

Discrete Structural Optimization

Journal of the Structural Division, 1971
The application of discrete programming to structural optimization permits the use of tabulated section properties and eliminates the need for approximate relations, such as between weight and section modulus, which may obscure the optimal solution.
openaire   +1 more source

Discrete Optimizing

Journal of the Society for Industrial and Applied Mathematics, 1965
Reiter, Stanley, Sherman, Gordon
openaire   +2 more sources