709 search results - page 42 / 142 » In-stroke word completion |
APPINF
2003
15 years 1 months ago
2003
The paper presents a method in teaching software process at under-graduate level, based on the Personal Software Process (PSP). The goal is to inform students about the process an...
ANLP
1992
15 years 1 months ago
1992
This paper describes, compares, and evaluates three different approaches for learning a semantic classification of library titles: 1) syntactically condensed titles, 2) complete t...
118
click to vote
CASC
2009
Springer
15 years 29 days ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
CONCUR
2010
Springer
15 years 28 days ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
APAL
2008
14 years 12 months ago
2008
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...