1092 search results - page 216 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
79
Voted
RTSS
1999
IEEE
15 years 1 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
PLDI
1997
ACM
15 years 1 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
CMSB
2006
Springer
15 years 1 months ago
2006
Springer
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
ICCD
1995
IEEE
15 years 1 months ago
1995
IEEE
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...