Sciweavers

5639 search results - page 434 / 1128
» Timed Abstract Non-interference
Sort
View
ECCC
2000
101views more  ECCC 2000»
15 years 4 months ago
Simplified derandomization of BPP using a hitting set generator
Abstract. A hitting-set generator is a deterministic algorithm that generates a set of strings such that this set intersects every dense set that is recognizable by a small circuit...
Oded Goldreich, Salil P. Vadhan, Avi Wigderson
CORR
2002
Springer
117views Education» more  CORR 2002»
15 years 4 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
GRAMMARS
2000
100views more  GRAMMARS 2000»
15 years 4 months ago
Tabulation of Automata for Tree-Adjoining Languages
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemon...
MOC
2000
97views more  MOC 2000»
15 years 4 months ago
Convergence rates to the discrete travelling wave for relaxation schemes
Abstract. This paper is concerned with the asymptotic convergence of numerical solutions toward discrete travelling waves for a class of relaxation numerical schemes, approximating...
Hailiang Liu
INFORMATICALT
1998
118views more  INFORMATICALT 1998»
15 years 4 months ago
Conservative Simulation for Discrete Event Systems
Abstract. More real systems have many components and their simulation requires significant execution times. The practical needs have conducted to distributed simulation rather tha...
Alexandru Cicortas