Results 221 to 230 of about 499,252 (266)
Some of the next articles are maybe not open access.
Genetic Algorithm Guided Selection: Variable Selection and Subset Selection
Journal of Chemical Information and Computer Sciences, 2002A novel Genetic Algorithm guided Selection method, GAS, has been described. The method utilizes a simple encoding scheme which can represent both compounds and variables used to construct a QSAR/QSPR model. A genetic algorithm is then utilized to simultaneously optimize the encoded variables that include both descriptors and compound subsets.
Sung Jin Cho, Mark A. Hermsmeier
openaire +2 more sources
Bulletin of Economic Research, 2000
This paper studies how schooling admission tests affect economic performance in an economy where individuals are endowed both with academic and non academic abilities and either ability matters for labour productivity. We show that the outcome of these abilities varies both with the degree of correlation of these abilities in the population and with ...
GIANNINI, MASSIMO, Brunello, G.
openaire +5 more sources
This paper studies how schooling admission tests affect economic performance in an economy where individuals are endowed both with academic and non academic abilities and either ability matters for labour productivity. We show that the outcome of these abilities varies both with the degree of correlation of these abilities in the population and with ...
GIANNINI, MASSIMO, Brunello, G.
openaire +5 more sources
Journal of Algorithms, 1999
Sequential selection has been solved in linear time by Blum et al. [M.B. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (4) (1972) 448-461 ]. Running this algorithm on a problem of size N with N > M, the size of the main-memory, results in an algorithm that reads and writes O(N) elements ...
openaire +2 more sources
Sequential selection has been solved in linear time by Blum et al. [M.B. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (4) (1972) 448-461 ]. Running this algorithm on a problem of size N with N > M, the size of the main-memory, results in an algorithm that reads and writes O(N) elements ...
openaire +2 more sources
Behavioral and Brain Sciences, 1981
AbstractHuman behavior is the joint product of (i) contingencies of survival responsible for natural selection, and (ii) contingencies of reinforcement responsible for the repertoires of individuals, including (iii) the special contingencies maintained by an evolved social environment.
openaire +2 more sources
AbstractHuman behavior is the joint product of (i) contingencies of survival responsible for natural selection, and (ii) contingencies of reinforcement responsible for the repertoires of individuals, including (iii) the special contingencies maintained by an evolved social environment.
openaire +2 more sources
Proceedings of ICCI'93: 5th International Conference on Computing and Information, 2002
Lane A. Hemachandra +5 more
openaire +2 more sources
Lane A. Hemachandra +5 more
openaire +2 more sources
Proceedings of the Companion Conference on Genetic and Evolutionary Computation, 2021
William George La Cava, Thomas Helmuth
openaire +3 more sources
William George La Cava, Thomas Helmuth
openaire +3 more sources
Theory of Chirality Induced Spin Selectivity: Progress and Challenges
Advanced Materials, 2022Leeor Kronik, Amnon Aharony, Oren Tal
exaly