444 search results - page 32 / 89 » Termination by Abstraction |
AUTOMATICA
2008
13 years 9 months ago
2008
Abstract-- This paper considers uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set which is a set of initial states prob...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
PKC
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract—This paper presents the design of a two-stage pseudodifferential operational transconductance amplifier (OTA). The circuit was designed in a standard 0.18 µm, 0.5 V VT ...