Results 61 to 70 of about 2,699 (261)

An Asymptotic Test of Optimality Conditions in Multiresponse Simulation Optimization [PDF]

open access: yesINFORMS Journal on Computing, 2012
This paper derives a novel, asymptotic statistical test of the Karush–Kuhn–Tucker first-order necessary optimality conditions in random simulation models with multiple responses. This test combines a simple form of the delta method and a generalized version of Wald's statistic.
Ebru Angün, Jack P. C. Kleijnen
openaire   +6 more sources

Benchmarking Coaxial and Angular Optical Emission Spectroscopy With Recommendations for Reliable Compositional In Situ Monitoring During Laser Powder Bed Fusion

open access: yesAdvanced Materials Technologies, EarlyView.
ABSTRACT Real‐time insight into local chemistry is critical for reliable part quality in additive manufacturing, especially laser powder bed fusion (PBF‑LB/M), where rapid thermal cycles and localized evaporation can undermine part performance. Optical emission spectroscopy (OES) offers non‑intrusive, in situ plume monitoring, but detection geometry ...
Philipp Gabriel   +4 more
wiley   +1 more source

Estimating a Finite Population Mean Using Transformed Data in Presence of Random Nonresponse

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2020
Developing finite population estimators of parameters such as mean, variance, and asymptotic mean squared error has been one of the core objectives of sample survey theory and practice.
Nelson Kiprono Bii   +2 more
doaj   +1 more source

Asymptotic optimal HEAPSORT algorithm

open access: yesTheoretical Computer Science, 1994
AbstractHeapsort algorithm HEAPSORT runs in a higher efficiency way. It has been improved to reduce the constant factor of the complexity. An asymptotic optimal heapsort algorithm is given in this paper. When the efficiency becomes the lowest, the constant factor of its complexity will not be more than 43.
Gu Xunrang, Zhu Yuzhang
openaire   +1 more source

Asymptotically Optimal Load Balancing Topologies [PDF]

open access: yesProceedings of the ACM on Measurement and Analysis of Computing Systems, 2018
We consider a system of N servers inter-connected by some underlying graph topology G N . Tasks with unit-mean exponential processing times arrive at the various servers as independent Poisson processes of rate λ.
Debankur Mukherjee   +2 more
openaire   +4 more sources

Engineering Exciton g‐Factors With Light in Type‐II Heterostructures

open access: yesAdvanced Optical Materials, EarlyView.
All‐optical approaches have emerged as cutting‐edge alternatives for ultrafast, energy‐efficient, and spatially localized tuning and switching of material properties. In our work, we demonstrate how light intensity alone can be leveraged to engineer g‐factors from a single‐type of carrier in type‐II heterostructures through Coulomb‐induced wavefunction
G. M. Jacobsen   +9 more
wiley   +1 more source

Backpropagation Through Soft Body: Investigating Information Processing in Brain–Body Coupling Systems

open access: yesAdvanced Robotics Research, EarlyView.
This study explores how information processing is distributed between brains and bodies through a codesign approach. Using the “backpropagation through soft body” framework, brain–body coupling agents are developed and analyzed across several tasks in which output is generated through the agents’ physical dynamics.
Hiroki Tomioka   +3 more
wiley   +1 more source

An asymptotic optimality result for the multiclass queue with finite buffers in heavy traffic

open access: yesStochastic Systems, 2015
For a multiclass G/G/1 queue with finite buffers, admission and scheduling control, and holding and rejection costs, we construct a policy that is asymptotically optimal in the heavy traffic limit.
Rami Atar, Mark Shifrin
doaj   +1 more source

Asymptotically optimal Boolean functions [PDF]

open access: yesJournal of Combinatorial Theory, Series A, 2019
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $ρ_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions.
openaire   +3 more sources

Modular, Textile‐Based Soft Robotic Grippers for Agricultural Produce Handling

open access: yesAdvanced Robotics Research, EarlyView.
This article introduces textile‐based pneumatic grippers that transform simple textiles into robust bending actuators. Detailed experiments uncover how cut geometry and fabric selection shape performance. Successful handling of fragile agricultural items showcases the potential of textile robotics for safe, scalable automation in food processing and ...
Zeyu Hou   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy