Sciweavers

1154 search results - page 62 / 231
» Mathematizing C concurrency
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
14 years 1 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
UML
2000
Springer
14 years 1 months ago
Dynamic Meta Modeling: A Graphical Approach to the Operational Semantics of Behavioral Diagrams in UML
In this paper, dynamic meta modeling is proposed as a new approach to the operational semantics of behavioral UML diagrams. The dynamic meta model extends the well-known static met...
Gregor Engels, Jan Hendrik Hausmann, Reiko Heckel,...
ICFP
2012
ACM
12 years 16 days ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
ICCS
2007
Springer
14 years 4 months ago
A Combined Hardware/Software Optimization Framework for Signal Representation and Recognition
This paper describes a signal recognition system that is jointly optimized from mathematical representation, algorithm design and final implementation. The goal is to exploit sign...
Melina Demertzi, Pedro C. Diniz, Mary W. Hall, Ann...
COMPGEOM
1992
ACM
14 years 2 months ago
Piercing Convex Sets
A family of sets has the (p, q) property if among any p members of the family some q have a nonempty intersection. It is shown that for every p q d + 1 there is a c = c(p, q, d)...
Noga Alon, Daniel J. Kleitman