9507 search results - page 1636 / 1902 » Time-based language models |
149
click to vote
TLCA
2005
Springer
16 years 2 days ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
159
click to vote
SIGCSE
2004
ACM
16 years 1 days ago
2004
ACM
The nearly three dozen core technologies of computing sit in a simple framework defined by great principles and by computing practices. The great principles are of two kinds, mech...
171
click to vote
CC
2004
Springer
16 years 14 hour ago
2004
Springer
This paper presents a new method for computing the integer hull of a parameterized rational polyhedron by introducing the concept of periodic polyhedron. Besides concerning general...
166
click to vote
CP
2004
Springer
16 years 12 hour ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
158
click to vote
CPAIOR
2004
Springer
16 years 12 hour ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...