Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Services Computing (9)
- Ethics (8)
- Privacy (8)
- RFID (6)
- Automatic Identification (5)
-
- Convergence (5)
- Information Systems (5)
- Location-Based Services (5)
- Radio-frequency Identification (5)
- Social Implications of ICT (5)
- Uberveillance (5)
- Bayesian Networks (4)
- Conference Proceedings (4)
- Intelligence (4)
- Microchip Implants (4)
- Surveillance (4)
- Automatic identification (3)
- Biometrics (3)
- Diagnosis (3)
- Kernel Learning & Support Vector Machine (3)
- Monitoring (3)
- NEUROSEMANTICS (3)
- Performance (3)
- Recursive Identification & Estimation (3)
- Tagging Network (3)
- Web Application (3)
- AUTISM (2)
- Arithmetic Circuits (2)
- Artificial intelligence (2)
- Bar code (2)
- Publication
-
- Professor Katina Michael (22)
- Professor Aditya K. Ghose (12)
- Jia Zhang (11)
- Marcel Adam Just (8)
- Andrew McCallum (7)
-
- Chien Hsun Chen (6)
- Hanna M. Wallach (5)
- Jens G. Pohl (5)
- Ole J Mengshoel (5)
- Eva Hudlicka (4)
- Dr. Yi Liu (3)
- Gabriel A. Moreno (3)
- Liana Napalkova (3)
- Nigam Rath (3)
- R. Manmatha (3)
- Song Zhang (3)
- Andrés Corrada-Emmanuel (2)
- Ankur Gupta (2)
- Arun Kulkarni (2)
- Associate Professor Katina Michael (2)
- Daron E Janzen, Ph.D. (2)
- Leslie Marsh (2)
- Rudolf Kaehr (2)
- William B. Andreopoulos (2)
- Xiao-Jun Yang (2)
- Zheng Sun (2)
- Adrian Gepp (1)
- Amber Settle (1)
- Bert Wachsmuth (1)
- C. Jason Woodard (1)
- File Type
Articles 151 - 153 of 153
Full-Text Articles in Physical Sciences and Mathematics
The Crowding Approach To Niching In Genetic Algorithms, Ole J. Mengshoel, David E. Goldberg
The Crowding Approach To Niching In Genetic Algorithms, Ole J. Mengshoel, David E. Goldberg
Ole J Mengshoel
A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of what we call local tournament algorithms. In addition to deterministic and probabilistic crowding, the family of local tournament algorithms includes the Metropolis algorithm, simulated annealing, restricted tournament selection, and parallel recombinative simulated annealing. We describe an algorithmic and analytical framework which is applicable to a wide range of crowding algorithms. As an example of utilizing this framework, we present and analyze the probabilistic crowding niching algorithm. Like the closely related deterministic crowding …
Tetra-N-ButylAmmonium Bis(2,2-DicyanoEthylEne-1,1-DithiolAto)Palladium(Ii), Nyasha Kanganga, Kent R. Mann, Daron E. Janzen
Tetra-N-ButylAmmonium Bis(2,2-DicyanoEthylEne-1,1-DithiolAto)Palladium(Ii), Nyasha Kanganga, Kent R. Mann, Daron E. Janzen
Daron E Janzen, Ph.D.
No abstract provided.
Tetra-N-Butyl-Ammonium Bis-(1,1-Dicyano-Ethyl-Ene-2,2-Dithiol-Ato)Platinum(Ii), Nyasha Kanganga, Kent R. Mann, Daron E. Janzen
Tetra-N-Butyl-Ammonium Bis-(1,1-Dicyano-Ethyl-Ene-2,2-Dithiol-Ato)Platinum(Ii), Nyasha Kanganga, Kent R. Mann, Daron E. Janzen
Daron E Janzen, Ph.D.
No abstract provided.