Sciweavers

1705 search results - page 54 / 341
» Representing Constraints with Automata
Sort
View
ENTCS
2006
231views more  ENTCS 2006»
13 years 7 months ago
SaveCCM: An Analysable Component Model for Real-Time Systems
Component based development is a promising approach for embedded systems. Typical for embedded software is the presence of resource constraints in multiple dimensions. An essentia...
Jan Carlson, John Håkansson, Paul Pettersson
CONCUR
2010
Springer
13 years 8 months ago
Parameterized Verification of Ad Hoc Networks
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavat...
ENTCS
2006
273views more  ENTCS 2006»
13 years 7 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
ICML
2007
IEEE
14 years 8 months ago
Revisiting probabilistic models for clustering with pair-wise constraints
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
Blaine Nelson, Ira Cohen
POPL
2010
ACM
14 years 5 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker