Sciweavers

1144 search results - page 192 / 229
» Logic programming for combinatorial problems
Sort
View
POPL
2008
ACM
14 years 8 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
14 years 7 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
PPDP
2005
Springer
14 years 1 months ago
Self-tuning resource aware specialisation for prolog
The paper develops a self-tuning resource aware partial evaluation technique for Prolog programs, which derives its own control strategies tuned for the underlying computer archit...
Stephen-John Craig, Michael Leuschel
CP
2003
Springer
14 years 27 days ago
Using Constraints for Exploring Catalogs
Abstract. Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data. Constraint programming has addre...
François Laburthe, Yves Caseau
CHI
1998
ACM
13 years 12 months ago
Adapting User Interface Design Methods to the Design of Educational Activities
considered simply, but a more complex evaluation of the effects of performing the tasks. For example, an educational activity that learners complete quickly and accurately is of no...
Clayton Lewis, Cathy Brand, Gina Cherry, Cyndi Rad...