Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Anja Remshagen"'
Autor:
Anja Remshagen, Kim C. Huett
Publikováno v:
TechTrends. 67:508-520
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d54773c683ac6ddf6320574ee59599d
https://doi.org/10.1007/s11528-023-00852-y
https://doi.org/10.1007/s11528-023-00852-y
Autor:
Christine Rolka, Anja Remshagen
Publikováno v:
International Journal for the Scholarship of Teaching and Learning, Vol 9, Iss 1 (2015)
Contextualized learning is considered beneficial for student success. In this article, we assess the impact of context-based learning tools on student grade performance in an introductory computer science course. In particular, we investigate two cen
Externí odkaz:
https://doaj.org/article/d2f07aa6a8144c33ae86d6326b86392b
Autor:
Anja Remshagen, Christine Rolka
Publikováno v:
International Journal for the Scholarship of Teaching and Learning, Vol 9, Iss 1 (2015)
Contextualized learning is considered beneficial for student success. In this article, we assess the impact of context-based learning tools on student grade performance in an introductory computer science course. In particular, we investigate two cen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce5b33fda7b7880f6e9c440aa0c6c00b
https://doi.org/10.20429/ijsotl.2015.090110
https://doi.org/10.20429/ijsotl.2015.090110
Autor:
Anja Remshagen, Klaus Truemper
Publikováno v:
Journal of Automated Reasoning. 34:31-47
In the futile questioning problem, one must decide whether acquisition of additional information can possibly lead to the proof of a conclusion. Solution of that problem demands evaluation of a quantified Boolean formula at the second level of the po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73b999e6d8c484b4c35819be5da08737
https://doi.org/10.1007/s10817-005-0981-8
https://doi.org/10.1007/s10817-005-0981-8
Autor:
Anja Remshagen, Christine Rolka
Publikováno v:
ACM Southeast Regional Conference
This paper explores the use of the two contextualized learning tools, animations and educational robots, in an introductory computer science course. We describe our experience when supplementing Greenfoot animation exercises with robotic exercises us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82256212be06bf126317afa49dae0544
https://doi.org/10.1145/2638404.2638458
https://doi.org/10.1145/2638404.2638458
Autor:
Li Yang, Anja Remshagen
Publikováno v:
CODASPY
As access control models have become more complex, tools should be developed to support the maintenance of policies. We have adapted a powerful privacy-aware role-based access control model to incorporate a context-restriction component to alleviate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7af5a35b25d0d0193199e263891aa86
https://doi.org/10.1145/2557547.2557581
https://doi.org/10.1145/2557547.2557581
Autor:
Anja Remshagen
Publikováno v:
ACM Southeast Regional Conference
New access control models have been developed to accommodate the implementation of new privacy policies. One of these models is the P-RBAC model by Ni et al. [8] which supports a wide range of privacy policies. However, while modeling policies has be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f2550cbbf30f82db484d6f2709afaf5
https://doi.org/10.1145/2498328.2500080
https://doi.org/10.1145/2498328.2500080
Autor:
Anja Remshagen
Publikováno v:
ACM Southeast Regional Conference
Discrete mathematics is an important foundation of computer science. Especially during the last decade, resources for instructors have been designed to meet the needs in computer science education. These resources try to present relevant concepts in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3055f8a6f3753da3d183eecfe05e0b58
https://doi.org/10.1145/1900008.1900060
https://doi.org/10.1145/1900008.1900060
Autor:
Anja Remshagen, B. Browning
Publikováno v:
ACM Southeast Regional Conference
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand to solve even more complex problems residing at the second or higher leve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::affb1487d83930cd8777069533869c38
https://doi.org/10.1145/1185448.1185456
https://doi.org/10.1145/1185448.1185456
Autor:
Anja Remshagen, N. Hristov
Publikováno v:
ACM Southeast Regional Conference (1)
Emerging applications demand to solve problems that are considered to be more difficult than NP-complete problems. Evaluating a quantified Boolean formula (QBF) is one of those problems. For the satisfiability problem (SAT), the NP-complete subclass
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2dfe929afd9a781b609d3d4722f92959
https://doi.org/10.1145/1167350.1167390
https://doi.org/10.1145/1167350.1167390