Sciweavers

4940 search results - page 81 / 988
» On the Complexity of Universal Programs
Sort
View
WSC
2004
15 years 5 months ago
Simulating Growth Dynamics in Complex Adaptive Supply Networks
This paper discusses an extended adaptive supply network simulation model that explicitly captures growth (in terms of change in size over time, and birth and death) based on Utte...
Surya Dev Pathak, David M. Dilts, Gautam Biswas
INTERACT
2003
15 years 5 months ago
HCI Education in the Czech Republic
: In this paper we report on some problems arising during the building of an educational system in the area of human computer interaction in the Czech Republic. An overview of teac...
Václav Matousek, Pavel Slavík
IJMTM
2006
85views more  IJMTM 2006»
15 years 4 months ago
Simulation in agent-based control systems: MAST case study
: The paper discusses the role of simulation in agent-based control systems. We present the universal runtime interface enabling efficient interactions between the agent control, m...
Pavel Vrba
CRYPTO
2006
Springer
104views Cryptology» more  CRYPTO 2006»
15 years 8 months ago
Random Selection with an Adversarial Majority
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
CSFW
2011
IEEE
14 years 4 months ago
The Complexity of Quantitative Information Flow Problems
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...