1220 search results - page 89 / 244 » Restricting grammatical complexity |
CADE
1998
Springer
14 years 2 hour ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
ICCD
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper proposes Dynamic Thermal Management (DTM) based on a dynamic voltage and frequency scaling (DVFS) technique for MPEG-4 decoding to guarantee thermal safety while mainta...
IEEESCC
2008
IEEE
14 years 2 months ago
2008
IEEE
Current web service platforms (WSPs) often perform all web services-related processing, including securitysensitive information handling, in the same protection domain. Consequent...
PODS
2010
ACM
14 years 25 days ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
AMAST
2006
Springer
13 years 11 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...