This study explored an algorithm for mapping the EORTC QLQ-C30 onto the EQ-5D index.
This paper explores an improved parallel algorithm based on user's requirement of spectrum.
For this reason, special attention is paid to these studies to explore an efficient algorithm using adaptive grid-point spacing in a finite-difference technique to figure out more practical mass transport models and convection-diffusion models efficiently.
This paper explores an adaptive subband communication algorithm, based on a delayless subband active noise reduction architecture, intended to adjust the communication channel gain to provide an appropriate speech signal power in relation to the instantaneous environmental noise power.
When the algorithm explores a tree node J, the algorithm calculates an upper bound B(J), which is no smaller than αk,K for any child node K (with cardinality k) of node J.
In this paper, we seek to explore a novel algorithm framework, called TRAMP, to learn action models with limited training data in a target domain, via transferring as much of the available information from other domains (called source domains) as possible to help the learning task, assuming action models in source domains can be transferred to the target domain.
Therefore, using breast tissue samples with histologically well-characterized lesions by H&E staining, we explored whether an algorithm could reproduce identical or near-identical morphological characterizations using CARS images.
An algorithm that explores a bounded set of parameters and determines the corresponding value of global indexes is presented.
To avoid this problem, Hafner et al. [ 20] developed an algorithm that explores a parameter space by iterative Gaussian sampling.
A case study involving primary through to quaternary crushing is presented, in which the evolutionary algorithm explores a selection of flowsheet configurations, in addition to local machine setting optimisations.
