Results 231 to 240 of about 370,118 (272)
Some of the next articles are maybe not open access.

A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs

Journal of Statistical Computation and Simulation, 2015
In the optimal experimental design literature, the G-optimality is defined as minimizing the maximum prediction variance over the entire experimental design space. Although the G-optimality is a highly desirable property in many applications, there are few computer algorithms developed for constructing G-optimal designs. Some existing methods employ an
Moein Saleh, Rong Pan
openaire   +2 more sources

Model-Robust Two-Level Designs Using Coordinate Exchange Algorithms and a Maximin Criterion

Technometrics, 2012
We propose a candidate-list-free exchange algorithm that facilitates construction of exact, model-robust, two-level experiment designs. In particular, we investigate two model spaces previously considered in the literature. The first assumes that all main effects and an unknown subset of two-factor interactions are active, but that the experimenter ...
Byran J. Smucker   +2 more
openaire   +2 more sources

A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments

Computational Statistics & Data Analysis, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sambo, Francesco   +2 more
openaire   +6 more sources

Construction of a 21-Component Layered Mixture Experiment Design Using a New Mixture Coordinate-Exchange Algorithm

Quality Engineering, 2005
This article describes the solution to a unique and challenging mixture experiment design problem involving (1) 19 and 21 components for two different parts of the design, (2) many single-component and multicomponent constraints, (3) augmentation of existing data, (4) a layered design developed in stages, and (5) a no-candidate-point optimal design ...
Greg F. Piepel   +2 more
openaire   +2 more sources

A MODIFIED CYCLIC-COORDINATE EXCHANGE ALGORITHM AS ILLUSTRATED BY THE CONSTRUCTION OF MINIMUM-POINT SECOND-ORDER DESIGNS

Advances in Statistics, Combinatorics and Related Areas, 2002
Box & Draper[1] reported ve m-factor D-optimal minimum-point second order designs for m = 2; : : : ; 5. The m coordinates of each of the n design points lie in the interval [i1; 1]. This paper describes a method of constructing these designs and compares new designs with those of Box & Draper.
Nam-Ky Nguyen
openaire   +2 more sources

Communication Algorithm-Architecture Co-Design for Distributed Deep Learning

International Symposium on Computer Architecture, 2021
Large-scale distributed deep learning training has enabled developments of more complex deep neural network models to learn from larger datasets for sophisticated tasks.
Jiayi Huang   +5 more
semanticscholar   +1 more source

Intrusion detection in mobile ad-hoc network using Hybrid Reactive Search and Bat algorithm

International Journal of Intelligent Unmanned Systems, 2021
PurposeThe mischievous nodes that defy the standard corrupt the exhibition of good nodes considerably. Therefore, an intrusion discovery mechanism should be included to the mobile ad-hoc network (MANET).
R. Srilakshmi, Jayabhaskar Muthukuru
semanticscholar   +1 more source

Studying the Effect of Network Latency on an Adaptive Coordinated Path Planning Algorithm for UAV Platoons

DroNet@MobiSys, 2022
UAVs can be directed to perform multiple tasks efficiently without human intervention. This is especially useful in tasks that require group coordination since UAVs can exchange information and alter their trajectories based on dynamic data.
Baisakhi Chatterjee, R. Dutta
semanticscholar   +1 more source

Stochastic coordinate-exchange optimal designs with complex constraints

Quality Engineering, 2018
The paper provides a method to construct the exact optimal experimental designs for both physical and computer experiments with any regular or irregularly constrained design space.
Lulu Kang
semanticscholar   +1 more source

A Distributed MIMO Relay Scheme Inspired by Backpropagation Algorithm

Global Communications Conference, 2021
This paper studies a distributed scheme for a multi-input multi-output (MIMO) relay network, where the transmit nodes are subject to the nonlinear instantaneous power constraints.
Rui Wang, Yi Jiang, Wei Zhang
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy