Sciweavers

3441 search results - page 519 / 689
» Parallel Logic Programming Systems
Sort
View
POPL
2008
ACM
16 years 6 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
ICSE
2005
IEEE-ACM
16 years 6 months ago
Object naming analysis for reverse-engineered sequence diagrams
UML sequence diagrams are commonly used to represent object interactions in software systems. This work considers the problem of extracting UML sequence diagrams from existing cod...
Atanas Rountev, Beth Harkness Connell
148
Voted
AIED
2007
Springer
16 years 10 days ago
Predicting Students' Performance with SimStudent: Learning Cognitive Skills from Observation
SimStudent is a machine-learning agent that learns cognitive skills by demonstration. SimStudent was originally built as a building block for Cognitive Tutor Authoring Tools to hel...
Noboru Matsuda, William W. Cohen, Jonathan Sewall,...
PADL
2001
Springer
15 years 10 months ago
Specifying Authentication Protocols Using Rewriting and Strategies
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
Horatiu Cirstea
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
15 years 8 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001