The DOI matches its OpenAlex record; 19 of the 19 references it cites were found in a registry or an index.
Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
TensorFlow: A system for large-scale machine learning
Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., et al. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.08695 · Cited by 11,822
Neural Architecture Search with Reinforcement Learning
Zoph, B., & Le, Q. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.01578 · Cited by 3,974
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning
Williams, R. J. (1992) · Machine Learning · doi:10.1007/bf00992696 · Cited by 3,416
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Arora, S. (1998) · Journal of the ACM · doi:10.1145/290179.290180 · Cited by 1,137
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Christofides, N. (2022) · Operations Research Forum · doi:10.1007/s43069-021-00101-z · Cited by 1,131
Taxonomy and Definitions for Terms Related to On-Road Motor Vehicle Automated Driving Systems
On-Road Automated Driving (ORAD) Committee (2017) · doi:10.4271/j3016_201401 · Cited by 675
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Smith, K. A. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.1.15 · Cited by 401
Learning to Learn without Gradient Descent by Gradient Descent
Chen, Y., Hoffman, M. W., Colmenarejo, S. G., Denil, M., Lillicrap, T., Botvinick, M., & de Freitas, N. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.03824 · Cited by 165
Fort, J. (1988) · Biological Cybernetics · doi:10.1007/bf00336888 · Cited by 130
A study of the application of Kohonen-type neural networks to the Travelling Salesman Problem
Favata, F., & Walker, R. (1991) · Biological Cybernetics · doi:10.1007/bf00202610 · Cited by 101
Noisy Parallel Approximate Decoding for Conditional Recurrent Language ModelPreprint
Cho, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.03835 · Cited by 83
Problem solving with optimization networks
Gee, A. (1993) · Cited by 37
Order Matters: Sequence to sequence for sets
Vinyals, O., Bengio, S., & Kudlur, M. (2015) · arXiv · doi:10.48550/arxiv.1511.06391
Cited by
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
A survey on deep learning and its applications
Dong, S., Wang, P., & Abbas, K. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100379 · Cited by 1,800
An Introduction to Deep Reinforcement Learning
Vincent, F.-L., Peter, H., Riashat, I., Marc, G. B., & Joelle, P. (2018) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000071 · Cited by 1,286
Fast Abstractive Summarization with Reinforce-Selected Sentence Rewriting
Chen, Y.-C., & Bansal, M. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1063 · Cited by 595
Deep Reinforcement Learning for Multiobjective Optimization
Li, K., Zhang, T., & Wang, R. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2977661 · Cited by 424
Metadata
- Authors
- Kain, T., Mundhenk, P., Müller, J.-S., Tompits, H., Wesche, M., & Decke, H.
- Venue
- OASIcs : OpenAccess Series in Informatics
- Publisher
- Schloss Dagstuhl — Leibniz-Zentrum fuer Informatik
- Published
- 2020-01-01
- ISSN
- 2190-6807 (ISSN-L)
- OpenAlex
- W2952332632
- Cited by
- 797
- References
- 19
- FWCI
- 52.31
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.