Sciweavers

FORTE
2010
13 years 6 months ago
Grouping Nodes in Wireless Sensor Networks Using Coalitional Game Theory
Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to rep...
Fatemeh Kazemeyni, Einar Broch Johnsen, Olaf Owe, ...
ICFCA
2010
Springer
13 years 11 months ago
Lattice Drawings and Morphisms
Let L → H be a lattice homomorphism and let a “readable” drawing of H be given. It is natural to make use of it to try getting a clear(er) drawing of L. Hence, the following ...
Vincent Duquenne
ICFCA
2010
Springer
13 years 11 months ago
Describing Role Models in Terms of Formal Concept Analysis
Abstract. In the past years Software Engineering has experienced several difficulties in modularising crosscutting aspects, like shared, dynamic or scattered behavior of object-ori...
Henri Mühle, Christian Wende
ICFCA
2010
Springer
13 years 11 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
Felix Distel
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
13 years 3 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
Formal Methods
Top of PageReset Settings