Sciweavers

3521 search results - page 355 / 705
» Algorithmic Control in Concurrent Computations
Sort
View
FSTTCS
2009
Springer
15 years 11 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
RECONFIG
2008
IEEE
268views VLSI» more  RECONFIG 2008»
15 years 11 months ago
Parametric, Secure and Compact Implementation of RSA on FPGA
1 We present a fast, efficient, and parameterized modular multiplier and a secure exponentiation circuit especially intended for FPGAs on the low end of the price range. The desig...
Ersin Oksuzoglu, Erkay Savas
DSD
2007
IEEE
120views Hardware» more  DSD 2007»
15 years 11 months ago
Latency Minimization for Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
Amir Hossein Ghamarian, Sander Stuijk, Twan Basten...
IJCNN
2006
IEEE
15 years 11 months ago
In-Place Learning for Positional and Scale Invariance
— In-place learning is a biologically inspired concept, meaning that the computational network is responsible for its own learning. With in-place learning, there is no need for a...
Juyang Weng, Hong Lu, Tianyu Luwang, Xiangyang Xue
ICN
2005
Springer
15 years 10 months ago
A Fast Path Recovery Mechanism for MPLS Networks
The major concept of the Multi-Protocol Label Switching (MPLS) network uses the Label Switch Path (LSP) technique that provides high performance in packet delivery without routing ...
Jenhui Chen, Chung-Ching Chiou, Shih-Lin Wu