Sciweavers

906 search results - page 65 / 182
» Linking Theories of Concurrency
Sort
View
IFIP
1992
Springer
15 years 10 months ago
Controller Implementation by Communicating Asynchronous Sequential Circuits Generated from a Petri Net Specification of Required
This paper presents a completely systematic design procedure for asynchronous controllers. The initial step is the construction of a signal transition graph (STG, an interpreted P...
Jochen Beister, Ralf Wollowski
CP
2010
Springer
15 years 4 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
ICASSP
2011
IEEE
14 years 10 months ago
Interference self-mitigating beamforming for the K-user MIMO IC
This work studies distributed linear transmission strategies for the multiple-input multiple-output (MIMO) interference channel with multiple concurrent links. We introduce the no...
Jianqi Wang, Amitav Mukherjee, A. Lee Swindlehurst
PPDP
2009
Springer
16 years 21 days ago
Session types for linear multithreaded functional programming
The construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on prec...
Vasco Thudichum Vasconcelos
VEE
2006
ACM
102views Virtualization» more  VEE 2006»
16 years 3 days ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym