Results 1 to 10 of about 2,580,594 (266)
Unmasking the giant: A comprehensive evaluation of ChatGPT's proficiency in coding algorithms and data structures [PDF]
International Conference on Agents and Artificial Intelligence, 2023 The transformative influence of Large Language Models (LLMs) is profoundly reshaping the Artificial Intelligence (AI) technology domain. Notably, ChatGPT distinguishes itself within these models, demonstrating remarkable performance in multi-turn ...
Sayed Erfan Arefin +4 more
semanticscholar +1 more source
ChatGPT Participates in a Computer Science Exam [PDF]
arXiv.org, 2023 We asked ChatGPT to participate in an undergraduate computer science exam on ''Algorithms and Data Structures''. The program was evaluated on the entire exam as posed to the students.
Sebastian Bordt, U. V. Luxburg
semanticscholar +1 more source
Studied Questions in Data Structures and Algorithms Assessments
Annual Conference on Innovation and Technology in Computer Science Education, 2023 Designing a proper exam that accurately evaluates students' knowledge and skills is one of the important tasks of every teacher. The format of the exams affects the way students learn throughout the course, and a well-designed exam can enhance meaningful
I. Gaber, Amir Kirsh, D. Statter
semanticscholar +1 more source
Computational identification of protein-coding sequences by comparative analysis [PDF]
International Journal of Data Mining and Bioinformatics, 2007 Gene prediction is an essential step in understanding the genome of a species once it has been sequenced. For that, a promising direction in current research on gene finding is a comparative genomics approach. In this paper, we present a novel approach to identifying evolutionarily conserved protein-coding sequences in genomes.
Wu, Feihong +3 more
openaire +19 more sources
A structural optimization algorithm with stochastic forces and stresses [PDF]
Nat. Comput. Sci. 2, 736-744 (2022), 2022 We propose an algorithm for optimizations in which the gradients contain stochastic noise. This arises, for example, in structural optimizations when computations of forces and stresses rely on methods involving Monte Carlo sampling, such as quantum Monte Carlo or neural network states, or are performed on quantum devices which have intrinsic noise ...
arxiv +1 more source
Physics and computer science: quantum computation and other approaches [PDF]
Math. Struct. in Comp. Science (2010), vol. 20, pp. 995-997, 2011 This is a position paper written as an introduction to the special volume on quantum algorithms I edited for the journal Mathematical Structures in Computer Science (Volume 20 - Special Issue 06 (Quantum Algorithms), 2010).
arxiv +1 more source
A Continuation Method for Nash Equilibria in Structured Games [PDF]
Journal Of Artificial Intelligence Research, Volume 25, pages
457-502, 2006, 2011 Structured game representations have recently attracted interest as models for multi-agent artificial intelligence scenarios, with rational behavior most commonly characterized by Nash equilibria. This paper presents efficient, exact algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi ...
arxiv +1 more source
Ockham's Razor in Memetic Computing: Three Stage Optimal Memetic Exploration [PDF]
Information Sciences, Volume 188, pp 17-43, 2012, 2018 Memetic Computing is a subject in computer science which considers complex structures as the combination of simple agents, memes, whose evolutionary interactions lead to intelligent structures capable of problem-solving. This paper focuses on Memetic Computing optimization algorithms and proposes a counter-tendency approach for algorithmic design ...
arxiv +1 more source
Low Rank Approximation in Simulations of Quantum Algorithms [PDF]
arXiv, 2021 Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits can be simulated efficiently on a classical computer if the input quantum state is a low-rank tensor and all ...
arxiv
Assessment of localized and randomized algorithms for electronic structure [PDF]
Electronic Structure 1, 033001 (2019), 2018 As electronic structure simulations continue to grow in size, the system-size scaling of computational costs increases in importance relative to cost prefactors. Presently, linear-scaling costs for three-dimensional systems are only attained by localized or randomized algorithms that have large cost prefactors in the difficult regime of low-temperature
arxiv +1 more source