2436 search results - page 222 / 488 » Comonadic Notions of Computation |
161
Voted
FSEN
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
166
click to vote
GTTSE
2007
Springer
16 years 26 days ago
2007
Springer
Model transformations are a key element in the OMG’s Model Driven Development agenda. They did not begin here: the fundamental idea of transforming, automatically, one model into...
135
click to vote
ICCS
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of...
165
click to vote
MFCS
2007
Springer
16 years 25 days ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
157
Voted
SAT
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...