Sciweavers

11547 search results - page 445 / 2310
» Quantum computing and communication
Sort
View
WOWMOM
2005
ACM
99views Multimedia» more  WOWMOM 2005»
16 years 13 days ago
Small Worlds and the Security of Ubiquitous Computing
This paper considers the small-world phenomenon in two contexts: ubiquitous computing and security. We argue that small-world properties emerge in ubicomp systems due to their nat...
Harald Vogt
SIGCSE
1999
ACM
83views Education» more  SIGCSE 1999»
15 years 11 months ago
Global cooperation project in computer programming course
A Global Cooperation Project was conducted with computer science classes at the Czech Technical University and North Hennepin Community College. The project was a pilot project fo...
Thomas Macek, Bozena Mannova, Josef Kolar, Barbara...
TACAS
1997
Springer
197views Algorithms» more  TACAS 1997»
15 years 11 months ago
Design/CPN - A Computer Tool for Coloured Petri Nets
In this paper, we describe the computer tool Design CPN supporting editing, simulation, and state space analysis of Coloured Petri Nets. So far, approximately 40 man-years have bee...
Søren Christensen, Jens Bæk Jø...
172
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
CAV
1993
Springer
108views Hardware» more  CAV 1993»
15 years 11 months ago
Computer-Assisted Simulation Proofs
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
Jørgen F. Søgaard-Andersen, Stephen ...