Sciweavers

25 search results - page 3 / 5
» uc 2005
Sort
View
UC
2005
Springer
13 years 10 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
UC
2005
Springer
13 years 10 months ago
On Model-Checking of P Systems
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
ICRA
2005
IEEE
175views Robotics» more  ICRA 2005»
13 years 10 months ago
Flexure Design Rules for Carbon Fiber Microrobotic Mechanisms
— Mechanisms utilizing rigid links and relatively small flexural joints are very suitable for fabrication at the meso scale. The Micromechanical Flying Insect (MFI) project at U...
Srinath Avadhanula, Ronald S. Fearing
CRYPTO
2005
Springer
137views Cryptology» more  CRYPTO 2005»
13 years 10 months ago
A Formal Treatment of Onion Routing
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
Jan Camenisch, Anna Lysyanskaya
EDO
2005
Springer
13 years 10 months ago
Optimizing layered middleware
Middleware is often built using a layered architectural style. Layered design provides good separation of the different concerns of middleware, such as communication, marshaling, ...
Ömer Erdem Demir, Premkumar T. Devanbu, Eric ...