Sciweavers

16430 search results - page 2897 / 3286
» On Computable Tree Functions
Sort
View
ASIACRYPT
2000
Springer
15 years 11 months ago
Zero-Knowledge and Code Obfuscation
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...
Satoshi Hada
CP
2000
Springer
15 years 11 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
DATE
2010
IEEE
140views Hardware» more  DATE 2010»
15 years 11 months ago
Construction of dual mode components for reconfiguration aware high-level synthesis
High-level synthesis has recently started to gain industrial acceptance, due to the improved quality of results and the multi-objective optimizations offered. One optimization area...
George Economakos, Sotirios Xydis, Ioannis Koutras...
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 11 months ago
Improving coverage analysis and test generation for large designs
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
Jules P. Bergmann, Mark Horowitz
AGENTS
1999
Springer
15 years 11 months ago
General Principles of Learning-Based Multi-Agent Systems
We consider the problem of how to design large decentralized multiagent systems (MAS’s) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a...
David Wolpert, Kevin R. Wheeler, Kagan Tumer
« Prev « First page 2897 / 3286 Last » Next »