Sciweavers

13621 search results - page 92 / 2725
» Computability and Complexity in Self-assembly
Sort
View
KES
1998
Springer
14 years 2 months ago
Attractor systems and analog computation
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...
Hava T. Siegelmann, Shmuel Fishman
TPDS
2008
125views more  TPDS 2008»
13 years 10 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
MFCS
1992
Springer
14 years 2 months ago
The Complexity of Graph Connectivity
In this paper we survey the major developments in understanding the complexity of the graph connectivity problem in several computational models, and highlight some challenging op...
Avi Wigderson
TCS
2011
13 years 5 months ago
Complexity of the traveling tournament problem
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...
Clemens Thielen, Stephan Westphal
MOBIHOC
2012
ACM
12 years 15 days ago
Serendipity: enabling remote computing among intermittently connected mobile devices
Mobile devices are increasingly being relied on for services that go beyond simple connectivity and require more complex processing. Fortunately, a mobile device encounters, possi...
Cong Shi, Vasileios Lakafosis, Mostafa H. Ammar, E...