From post

CodeHelp: Using Large Language Models with Guardrails for Scalable Support in Programming Classes

, , , и . Proceedings of the 23rd Koli Calling International Conference on Computing Education Research, стр. 1–11. New York, NY, USA, Association for Computing Machinery, (06.02.2024)
DOI: 10.1145/3631802.3631830

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

CodeHelp: Using Large Language Models with Guardrails for Scalable Support in Programming Classes, , , и . Proceedings of the 23rd Koli Calling International Conference on Computing Education Research, стр. 1–11. New York, NY, USA, Association for Computing Machinery, (06.02.2024)Analyzing Infeasible Constraint Systems.. University of Michigan, USA, (2009)Patterns of Student Help-Seeking When Using a Large Language Model-Powered Programming Assistant., , , и . ACE, стр. 49-57. ACM, (2024)Identifying Conflicts in Overconstrained Temporal Problems., , , и . IJCAI, стр. 205-211. Professional Book Center, (2005)Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints., и . J. Autom. Reason., 40 (1): 1-33 (2008)A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas., , , , , и . Constraints An Int. J., 14 (4): 415-442 (2009)Searching for Autarkies to Trim Unsatisfiable Clause Sets., и . SAT, том 4996 из Lecture Notes in Computer Science, стр. 182-195. Springer, (2008)Improved Design Debugging Using Maximum Satisfiability., , , , и . FMCAD, стр. 13-19. IEEE Computer Society, (2007)MaxSAT-Based MCS Enumeration., , и . Haifa Verification Conference, том 7857 из Lecture Notes in Computer Science, стр. 86-101. Springer, (2012)Exploiting structure in symmetry detection for CNF., , , и . DAC, стр. 530-534. ACM, (2004)