Остановите войну!
for scientists:
default search action
Richard K. Belew
- > Home > Persons > Richard K. Belew
Publications
- 2016
- [j21]Richard K. Belew, Stefano Forli, David S. Goodsell, T. J. O'Donnell, Arthur J. Olson:
Fragment-Based Analysis of Ligand Dockings Improves Classification of Actives. J. Chem. Inf. Model. 56(8): 1597-1607 (2016) - 2009
- [j20]Garrett M. Morris, Ruth Huey, William Lindstrom, Michel F. Sanner, Richard K. Belew, David S. Goodsell, Arthur J. Olson:
AutoDock4 and AutoDockTools4: Automated docking with selective receptor flexibility. J. Comput. Chem. 30(16): 2785-2791 (2009) - 2008
- [j19]Max W. Chang, Richard K. Belew, Kate S. Carroll, Arthur J. Olson, David S. Goodsell:
Empirical entropic contributions in computational docking: Evaluation in APS reductase complexes. J. Comput. Chem. 29(11): 1753-1761 (2008) - 2007
- [j18]Max W. Chang, William Lindstrom, Arthur J. Olson, Richard K. Belew:
Analysis of HIV Wild-Type and Mutant Structures via in Silico Docking against Diverse Ligand Libraries. J. Chem. Inf. Model. 47(3): 1258-1262 (2007) - 1998
- [j15]Christopher D. Rosin, Richard K. Belew, Garrett M. Morris, Arthur J. Olson, David S. Goodsell:
Computational Coevolution of Antiviral Drug Resistance. Artif. Life 4(1): 41-59 (1998) - [j13]Garrett M. Morris, David S. Goodsell, Robert S. Halliday, Ruth Huey, William E. Hart, Richard K. Belew, Arthur J. Olson:
Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function. J. Comput. Chem. 19(14): 1639-1662 (1998) - [c23]Thomas E. Kammeyer, Richard K. Belew:
An Empirical Investigation of an Evolutionary Algorithm's Ability to Maintain a Known Good Solution. Evolutionary Programming 1998: 767-776 - 1997
- [j12]Christopher D. Rosin, Richard K. Belew:
New Methods for Competitive Coevolution. Evol. Comput. 5(1): 1-29 (1997) - [c22]Christopher D. Rosin, R. Scott Halliday, William E. Hart, Richard K. Belew:
A Comparison of Global and Local Search Methods in Drug Docking. ICGA 1997: 221-229 - 1996
- [c20]Christopher D. Rosin, Richard K. Belew:
A Competitive Approach to Game Learning. COLT 1996: 292-302 - [c19]Thomas E. Kammeyer, Richard K. Belew:
Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search. FOGA 1996: 409-436 - [c18]William E. Hart, Scott B. Baden, Richard K. Belew, Scott R. Kohn:
Analysis of the Numerical Effects of Parallelism on a Parallel Genetic Algorithm. IPPS 1996: 606-612 - 1995
- [j8]Thomas E. Kammeyer, Richard K. Belew, S. G. Williamson:
Evolving Compare-Exchange Networks Using Grammars. Artif. Life 2(2): 199-237 (1995) - [c15]Christopher D. Rosin, Richard K. Belew:
Methods for Competitive Co-Evolution: Finding Opponents Worth Beating. ICGA 1995: 373-381 - 1994
- [c13]Thomas E. Kammeyer, Richard K. Belew:
Learning Sorting Networks By Grammars. AAAI 1994: 1466 - [c12]William E. Hart, Thomas E. Kammeyer, Richard K. Belew:
The Role of Development in Genetic Algorithms. FOGA 1994: 315-332 - 1993
- [c10]Richard K. Belew, Thomas E. Kammeyer:
Evolving Aesthetic Sorting Networks Using Developmental Grammars. ICGA 1993: 629 - 1991
- [c7]William E. Hart, Richard K. Belew:
Optimising an Arbitrary Function is Hard for the Genetic Algorithm. ICGA 1991: 190-195
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint