1071 search results - page 150 / 215 » Programming with enumerable sets of structures |
142
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
168
click to vote
WIA
2009
Springer
16 years 23 days ago
2009
Springer
FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy pro...
141
click to vote
GLOBECOM
2007
IEEE
16 years 15 days ago
2007
IEEE
— In this paper we propose Cognitive Medium Access (CMA), a protocol aimed at improving coexistence with a set of independently evolving WLAN bands. A time-slotted physical layer...
163
click to vote
CONCUR
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
162
click to vote
CP
2007
Springer
16 years 10 days ago
2007
Springer
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...