Sciweavers

70 search results - page 5 / 14
» (U, N)-Implications and Their Characterizations
Sort
View
APAL
2007
79views more  APAL 2007»
13 years 7 months ago
A completeness result for a realisability semantics for an intersection type system
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
Fairouz Kamareddine, Karim Nour
ICS
2000
Tsinghua U.
13 years 11 months ago
Using complete system simulation to characterize SPECjvm98 benchmarks
Complete system simulation to understand the influence of architecture and operating systems on application execution has been identified to be crucial for systems design. While t...
Tao Li, Lizy Kurian John, Narayanan Vijaykrishnan,...
APAL
2011
13 years 2 months ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
MCSS
2006
Springer
13 years 7 months ago
Optimal input sets for time minimality in quantized control systems
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...
Alessia Marigo
NC
2007
123views Neural Networks» more  NC 2007»
13 years 7 months ago
The complexity of latching transitions in large scale cortical networks
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an in...
Emilio Kropff, Alessandro Treves