Results 241 to 250 of about 3,868,631 (298)
Some of the next articles are maybe not open access.
Biotechnology Progress, 1998
In vitro selection can be used to generate nucleic acid ligands (aptamers) to target molecules ranging in size and structure from cations to cells. However, the selection process is repetitive and time-consuming. We have automated a protocol for in vitro selection using an augmented Beckman Biomek 2000 pipetting robot. The automated selection procedure
J C, Cox, P, Rudolph, A D, Ellington
openaire +2 more sources
In vitro selection can be used to generate nucleic acid ligands (aptamers) to target molecules ranging in size and structure from cations to cells. However, the selection process is repetitive and time-consuming. We have automated a protocol for in vitro selection using an augmented Beckman Biomek 2000 pipetting robot. The automated selection procedure
J C, Cox, P, Rudolph, A D, Ellington
openaire +2 more sources
Automated feature selection in neuroevolution
Evolutionary Intelligence, 2009Feature selection is a task of great importance. Many feature selection methods have been proposed, and can be divided generally into two groups based on their dependence on the learning algorithm/classifier. Recently, a feature selection method that selects features at the same time as it evolves neural networks that use those features as inputs ...
TAN, Maxine Yen Ling +3 more
openaire +2 more sources
Automating the Selection of Implementation Structures
IEEE Transactions on Software Engineering, 1978An approach to automating the selection of implementations for the data representations used in a program is presented. Formalisms are developed for specifying data representations and implementation structures. Using these formalisms, algorithms are presented which will recognize the use in a program of known data representations (e.
Lawrence A. Rowe, Fred M. Tonge
openaire +2 more sources
Automating the selection of code templates
Software: Practice and Experience, 1985AbstractA new methodology for code generation in compilers is advanced. The underlying principle is a simple one—that machine memory resources must be matched to intermediate code values. It is possible to view the methodology as a generalization of the Graham‐Glanville approach, but where there is a wider‐ranging search for the best code sequences ...
R. Nigel Horspool, André Scheunemann
openaire +1 more source
Automated selection of mathematical software
ACM Transactions on Mathematical Software, 1992Current approaches to recommending mathematical software are qualitative and categorical. These approaches are unsatisfactory when the problem to be solved has features that can “trade-off” in the recommendation process. A quantitative system is proposed that permits tradeoffs and can be built and modified incrementally.
Michael Lucks, Ian Gladwell
openaire +2 more sources
A Methodology to Automate the Security Patterns Selection
2021Security has become an important issue for software systems. The numbers of threats are advancing day by day making it more challengeable to cope with it. During the software development life cycle (especially security oriented applications) it is difficult for the novice users to adopt the security measures correctly.
Khudema Zahra +5 more
openaire +1 more source