Sciweavers

302 search results - page 39 / 61
» Deriving input syntactic structure from execution
Sort
View
SPAA
2009
ACM
14 years 10 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
JPDC
2006
111views more  JPDC 2006»
13 years 9 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
EMSOFT
2004
Springer
14 years 3 months ago
Heterogeneous reactive systems modeling: capturing causality and the correctness of loosely time-triggered architectures (LTTA)
We present an extension of a mathematical framework proposed by the authors to deal with the composition of heterogeneous reactive systems. Our extended framework encompasses dive...
Albert Benveniste, Benoît Caillaud, Luca P. ...
IWANN
2005
Springer
14 years 3 months ago
Co-evolutionary Learning in Liquid Architectures
A large class of problems requires real-time processing of complex temporal inputs in real-time. These are difficult tasks for state-of-the-art techniques, since they require captu...
Igal Raichelgauz, Karina Odinaev, Yehoshua Y. Zeev...
ICASSP
2009
IEEE
13 years 7 months ago
Spoken language interpretation: On the use of dynamic Bayesian networks for semantic composition
In the context of spoken language interpretation, this paper introduces a stochastic approach to infer and compose semantic structures. Semantic frame structures are directly deri...
Marie-Jean Meurs, Fabrice Lefevre, Renato de Mori