376 search results - page 30 / 76 » Developing Theories of Types and Computability via Realizabi... |
HYBRID
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
CIE
2010
Springer
14 years 11 days ago
2010
Springer
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...
ICWS
2009
IEEE
14 years 4 months ago
2009
IEEE
Analyzing interactions among peers that interact via messages is a crucial problem due to increasingly distributed nature of current software systems, especially the ones built us...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
JFP
2008
13 years 7 months ago
2008
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...