default search action
Fundamenta Informaticae, Volume 108
Volume 108, Numbers 1-2, 2011
- Stephen A. Edwards, Ryszard Janicki, Walter Vogler:
Preface. - Josep Carmona, Jorge Júlvez, Jordi Cortadella, Michael Kishinevsky:
A Scheduling Strategy for Synchronous Elastic Designs. 1-21 - Silvia Crafa, Francesco Ranzato, Francesco Tapparo:
Saving Space in a Time Efficient Simulation Algorithm. 23-42 - Niels Lohmann, Karsten Wolf:
Compact Representations and Efficient Algorithms for Operating Guidelines. 43-62 - Andrey Mokhov, Victor Khomenko, Alexandre Yakovlev:
Flat Arbiters. 63-90 - Dumitru Potop-Butucaru, Yves Sorel, Robert de Simone, Jean-Pierre Talpin:
From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations. 91-118 - Jean-Baptiste Raclet, Éric Badouel, Albert Benveniste, Benoît Caillaud, Axel Legay, Roberto Passerone:
A Modal Interface Theory for Component-based Design. 119-149 - Karsten Wolf, Christian Stahl, Daniela Weinberg, Janine Ott, Robert Danitz:
Guaranteeing Weak Termination in Service Discovery. 151-180
Volume 108, Numbers 3-4, 2011
- Davide Ciucci, Yiyu Yao:
Preface. - Marcin Wolski:
Monadic Algebras: a Standpoint on Rough Sets. 181-196 - Gianpiero Cattaneo:
An Investigation About Rough Set Theory: Some Foundational and Mathematical Aspects. 197-221 - Inés Couso, Didier Dubois:
Rough Sets, Coverings and Incomplete Information. 223-247 - Yiyu Yao:
Two Semantic Issues in a Probabilistic Rough Set Model. 249-265 - Joseph P. Herbert, Jingtao Yao:
Game-Theoretic Rough Sets. 267-286 - Davide Ciucci:
Orthopairs: A Simple and Widely UsedWay to Model Uncertainty. 287-304 - Murat Diker:
Textures and Fuzzy Rough Sets. 305-336 - Wei-Zhi Wu:
On Some Mathematical Structures of T-Fuzzy Rough Set Algebras in Infinite Universes of Discourse. 337-369
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.