Sciweavers

564 search results - page 9 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
TCS
2010
14 years 8 months ago
On the expressiveness of interaction
Subbisimilarity is proposed as a general tool to classify the relative expressive power of process calculi. The expressiveness of several variants of CCS is compared in terms of t...
Yuxi Fu, Hao Lu
HOTI
2011
IEEE
13 years 9 months ago
iWISE: Inter-router Wireless Scalable Express Channels for Network-on-Chips (NoCs) Architecture
Abstract—Network-on-Chips (NoCs) paradigm is fast becoming a defacto standard for designing communication infrastructure for multicores with the dual goals of reducing power cons...
Dominic DiTomaso, Avinash Kodi, Savas Kaya, David ...
BMCBI
2007
122views more  BMCBI 2007»
14 years 9 months ago
Dissecting complex transcriptional responses using pathway-level scores based on prior information
Background: The genomewide pattern of changes in mRNA expression measured using DNA microarrays is typically a complex superposition of the response of multiple regulatory pathway...
Harmen J. Bussemaker, Lucas D. Ward, André ...
68
Voted
CORR
2010
Springer
141views Education» more  CORR 2010»
14 years 9 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
FOCS
2002
IEEE
15 years 2 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg