Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Andrew N. Sloss
@article{DBLP:journals/corr/abs-2301-10333, author = {Andrew N. Sloss}, title = {Lost in Algorithms}, journal = {CoRR}, volume = {abs/2301.10333}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2301.10333}, doi = {10.48550/ARXIV.2301.10333}, eprinttype = {arXiv}, eprint = {2301.10333}, timestamp = {Thu, 26 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2301-10333.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/computer/CrawfordS22, author = {Rod F. Crawford and Andrew N. Sloss}, title = {Is Expressiveness the Future of Software?}, journal = {Computer}, volume = {55}, number = {1}, pages = {43--52}, year = {2022}, url = {https://doi.org/10.1109/MC.2021.3120667}, doi = {10.1109/MC.2021.3120667}, timestamp = {Mon, 24 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/computer/CrawfordS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gecco/PeelerLSR0B22, author = {Hannah Peeler and Shuyue Stella Li and Andrew N. Sloss and Kenneth N. Reid and Yuan Yuan and Wolfgang Banzhaf}, editor = {Jonathan E. Fieldsend and Markus Wagner}, title = {Optimizing {LLVM} pass sequences with shackleton: a linear genetic programming framework}, booktitle = {{GECCO} '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9 - 13, 2022}, pages = {578--581}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3520304.3528945}, doi = {10.1145/3520304.3528945}, timestamp = {Mon, 25 Jul 2022 17:04:27 +0200}, biburl = {https://dblp.org/rec/conf/gecco/PeelerLSR0B22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gecco/LiPSRB22, author = {Shuyue Stella Li and Hannah Peeler and Andrew N. Sloss and Kenneth N. Reid and Wolfgang Banzhaf}, editor = {Jonathan E. Fieldsend and Markus Wagner}, title = {Genetic improvement in the shackleton framework for optimizing {LLVM} pass sequences}, booktitle = {{GECCO} '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9 - 13, 2022}, pages = {1938--1939}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3520304.3534000}, doi = {10.1145/3520304.3534000}, timestamp = {Thu, 21 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/gecco/LiPSRB22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2201-13305, author = {Hannah Peeler and Shuyue Stella Li and Andrew N. Sloss and Kenneth N. Reid and Yuan Yuan and Wolfgang Banzhaf}, title = {Optimizing {LLVM} Pass Sequences with Shackleton: {A} Linear Genetic Programming Framework}, journal = {CoRR}, volume = {abs/2201.13305}, year = {2022}, url = {https://arxiv.org/abs/2201.13305}, eprinttype = {arXiv}, eprint = {2201.13305}, timestamp = {Wed, 02 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2201-13305.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2204-13261, author = {Shuyue Stella Li and Hannah Peeler and Andrew N. Sloss and Kenneth N. Reid and Wolfgang Banzhaf}, title = {Genetic Improvement in the Shackleton Framework for Optimizing {LLVM} Pass Sequences}, journal = {CoRR}, volume = {abs/2204.13261}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2204.13261}, doi = {10.48550/ARXIV.2204.13261}, eprinttype = {arXiv}, eprint = {2204.13261}, timestamp = {Mon, 02 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2204-13261.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2008-07324, author = {Karl Fezer and Andrew N. Sloss}, title = {Intelligence Primer}, journal = {CoRR}, volume = {abs/2008.07324}, year = {2020}, url = {https://arxiv.org/abs/2008.07324}, eprinttype = {arXiv}, eprint = {2008.07324}, timestamp = {Fri, 21 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2008-07324.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gptp/SlossG19, author = {Andrew N. Sloss and Steven Gustafson}, editor = {Wolfgang Banzhaf and Erik D. Goodman and Leigh Sheneman and Leonardo Trujillo and Bill Worzel}, title = {2019 Evolutionary Algorithms Review}, booktitle = {Genetic Programming Theory and Practice {XVII} {[GPTP} 2019, Michigan State University, East Lansing, Michigan, USA, May 16-19, 2019]}, pages = {307--344}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-39958-0\_16}, doi = {10.1007/978-3-030-39958-0\_16}, timestamp = {Tue, 12 May 2020 16:35:24 +0200}, biburl = {https://dblp.org/rec/conf/gptp/SlossG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-08870, author = {Andrew N. Sloss and Steven Gustafson}, title = {2019 Evolutionary Algorithms Review}, journal = {CoRR}, volume = {abs/1906.08870}, year = {2019}, url = {http://arxiv.org/abs/1906.08870}, eprinttype = {arXiv}, eprint = {1906.08870}, timestamp = {Mon, 24 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-08870.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/computer/GoodacreS05, author = {John Goodacre and Andrew N. Sloss}, title = {Parallelism and the {ARM} Instruction Set Architecture}, journal = {Computer}, volume = {38}, number = {7}, pages = {42--50}, year = {2005}, url = {https://doi.org/10.1109/MC.2005.239}, doi = {10.1109/MC.2005.239}, timestamp = {Wed, 12 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/computer/GoodacreS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.