Sciweavers

1187 search results - page 86 / 238
» Computation in Extended Argumentation Frameworks
Sort
View
CONCUR
2009
Springer
15 years 5 months ago
Algebra for Infinite Forests with an Application to the Temporal Logic EF
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
Mikolaj Bojanczyk, Tomasz Idziaszek
FMOODS
2003
15 years 2 months ago
Towards Object-Oriented Graphs and Grammars
This work aims to extend the algebraical approach to graph transformation to model object-oriented systems structures and computations. A graph grammar based formal framework for o...
Ana Paula Lüdtke Ferreira, Leila Ribeiro
HICSS
1994
IEEE
141views Biometrics» more  HICSS 1994»
15 years 5 months ago
Empirical CATeam Research in Meetings
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
Helmut Krcmar, Henrik Lewe, Gerhard Schwabe
DAC
2005
ACM
16 years 2 months ago
Designing logic circuits for probabilistic computation in the presence of noise
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 1 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass