Sciweavers

723 search results - page 33 / 145
» Reducing the complexity of the issue logic
Sort
View
ASIACRYPT
2001
Springer
14 years 3 days ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
ASC
2007
14 years 6 months ago
A BDI Agent System for Credit Risk Assessment based on Fuzzy Logic
Credit risk has always been an important issue for banks and other financial intermediaries. A reliable and consistent computing system is necessary to simplify the decision mak...
S. Bonura, V. Morreale, G. Cammarata, F. Cantore,...
POPL
2010
ACM
13 years 10 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...
ISSTA
1989
ACM
13 years 11 months ago
The Logic of Propagation in the Inscape Environment
The Inscape Environment research project addresses issues in supporting the development of large systems by large numbers of programmers. One aspect of this research is the ‘‘...
D. Perry
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann