925 search results - page 78 / 185 » Connectivity on Complete Lattices |
149
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...
172
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
184
click to vote
AML
2010
15 years 6 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
153
click to vote
AML
2006
15 years 6 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
152
click to vote
AHSWN
2005
15 years 6 months ago
2005
Over the last few years, novel architectures like ad hoc and sensor networks have introduced new challenges in the way the communication infrastructure must be addressed. Unlike t...