Остановите войну!
for scientists:
default search action
Arthur C. Sanderson
- > Home > Persons > Arthur C. Sanderson
Publications
- 2009
- [j40]Jingqiao Zhang, Arthur C. Sanderson:
JADE: Adaptive Differential Evolution With Optional External Archive. IEEE Trans. Evol. Comput. 13(5): 945-958 (2009) - [j39]Feng Xue, Arthur C. Sanderson, Robert J. Graves:
Multiobjective Evolutionary Decision Support for Design-Supplier-Manufacturing Planning. IEEE Trans. Syst. Man Cybern. Part A 39(2): 309-320 (2009) - [c70]Zhenyu Yang, Jingqiao Zhang, Ke Tang, Xin Yao, Arthur C. Sanderson:
An adaptive coevolutionary Differential Evolution algorithm for large-scale optimization. IEEE Congress on Evolutionary Computation 2009: 102-109 - 2008
- [c68]Jingqiao Zhang, Viswanath Avasarala, Arthur C. Sanderson, Tracy Mullen:
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems. IEEE Congress on Evolutionary Computation 2008: 2794-2800 - [c67]Jingqiao Zhang, Arthur C. Sanderson:
Self-adaptive multi-objective differential evolution with direction information provided by archived inferior solutions. IEEE Congress on Evolutionary Computation 2008: 2801-2810 - 2007
- [c66]Jingqiao Zhang, Arthur C. Sanderson:
An approximate gaussian model of Differential Evolution with spherical fitness functions. IEEE Congress on Evolutionary Computation 2007: 2220-2228 - [c65]Jingqiao Zhang, Arthur C. Sanderson:
JADE: Self-adaptive differential evolution with fast and reliable convergence performance. IEEE Congress on Evolutionary Computation 2007: 2251-2258 - [c64]Jingqiao Zhang, Arthur C. Sanderson:
DE-AEC: A differential evolution algorithm based on adaptive evolution control. IEEE Congress on Evolutionary Computation 2007: 3824-3830 - 2005
- [j38]Robert J. Graves, Arthur C. Sanderson, Raj Subbu:
A scalable e-engineering technology for network-based concurrent engineering in electronics. Int. J. Comput. Integr. Manuf. 18(5): 395-401 (2005) - [c61]Feng Xue, Arthur C. Sanderson, Robert J. Graves:
Multi-objective evolutionary decision support for design-supplier-manufacturing planning. CASE 2005: 197-202 - [c60]Feng Xue, Arthur C. Sanderson, Robert J. Graves:
Modeling and convergence analysis of a continuous multi-objective differential evolution algorithm. Congress on Evolutionary Computation 2005: 228-235 - [c59]Feng Xue, Arthur C. Sanderson, Robert J. Graves:
Multi-objective differential evolution - algorithm, convergence analysis, and applications. Congress on Evolutionary Computation 2005: 743-750 - [c58]Feng Xue, Arthur C. Sanderson, Piero P. Bonissone, Robert J. Graves:
Fuzzy Logic Controlled Multi-Objective Differential Evolution. FUZZ-IEEE 2005: 720-725 - 2004
- [b3]Raj Subbu, Arthur C. Sanderson:
Network-Based Distributed Planning Using Coevolutionary Algorithms. Series in Intelligent Control and Intelligent Automation 13, WorldScientific 2004, ISBN 978-981-238-754-7, pp. 1-192 - [j37]Raj Subbu, Arthur C. Sanderson:
Network-based distributed planning using coevolutionary agents: architecture and evaluation. IEEE Trans. Syst. Man Cybern. Part A 34(2): 257-269 (2004) - [j36]Raj Subbu, Arthur C. Sanderson:
Modeling and convergence analysis of distributed coevolutionary algorithms. IEEE Trans. Syst. Man Cybern. Part B 34(2): 806-822 (2004) - 2003
- [c55]Feng Xue, Arthur C. Sanderson, Robert J. Graves:
Pareto-based multi-objective differential evolution. IEEE Congress on Evolutionary Computation 2003: 862-869 - [c53]Feng Xue, Arthur C. Sanderson, Robert J. Graves:
Multi-objective differential evolution and its application to enterprise planning. ICRA 2003: 3535-3541 - 2002
- [c52]Raj Subbu, Arthur C. Sanderson:
Network performance of distributed coevolutionary agents. IEEE Congress on Evolutionary Computation 2002: 1414-1419 - [c51]Amit Kumar, Arthur C. Sanderson, Robert J. Graves, Raj Subbu:
Distributed Relational Decision Framework for Scalable Enterprise Systems. ICRA 2002: 775-780 - 2001
- [j33]Cem Hocaoglu, Arthur C. Sanderson:
Planning multiple paths with evolutionary speciation. IEEE Trans. Evol. Comput. 5(3): 169-191 (2001) - [c50]Raj Subbu, Arthur C. Sanderson:
Network Distributed Virtual Design using Coevolutionary Agents. ICRA 2001: 824-829 - 2000
- [c49]Raj Subbu, Arthur C. Sanderson:
Modeling and convergence analysis of distributed co-evolutionary algorithms. CEC 2000: 1276-1283 - 1998
- [c43]Raj Subbu, Cem Hocaoglu, Arthur C. Sanderson:
A Virtual Design Environment using Evolutionary Agents. ICRA 1998: 247-253 - [c42]Cem Hocaoglu, Arthur C. Sanderson:
Evolutionary Path Planning Using Multi-Resolution Path Representation. ICRA 1998: 318-323 - 1997
- [j27]Cem Hocaoglu, Arthur C. Sanderson:
Multimodal Function Optimization Using Minimal Representation Size Clustering and Its Application to Planning Multipaths. Evol. Comput. 5(1): 81-104 (1997) - 1996
- [c37]Cem Hocaoglu, Arthur C. Sanderson:
Planning Multi-Paths Using Speciation in Genetic Algorithms. International Conference on Evolutionary Computation 1996: 378-383 - 1995
- [c33]Cem Hocaoglu, Arthur C. Sanderson:
Evolutionary Speciation Using Minimal Representation Size Clustering. Evolutionary Programming 1995: 187-203
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-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint