Sciweavers

32 search results - page 3 / 7
» Bounded rationality via recursion
Sort
View
VLSID
2008
IEEE
83views VLSI» more  VLSID 2008»
14 years 6 months ago
Efficient Linear Macromodeling via Discrete-Time Time-Domain Vector Fitting
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
Chi-Un Lei, Ngai Wong
FOCS
1998
IEEE
13 years 10 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 6 months ago
Reasoning in Abella about Structural Operational Semantics Specifications
The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses -tree syntax to treat object ...
Andrew Gacek, Dale Miller, Gopalan Nadathur
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 6 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
CONCUR
2012
Springer
11 years 8 months ago
MSO Decidability of Multi-Pushdown Systems via Split-Width
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar