default search action
Fundamenta Informaticae, Volume 72
Volume 72, Number 1-3, 2006
- Maria V. Andreeva, Irina B. Virbitskaite:
Observational Equivalences for Timed Stable Event Structures. 1-19 - Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina:
A Calculus of Looping Sequences for Modelling Microbiological Systems. 21-35 - Jan G. Bazan:
Behavioral Pattern Identification Through Rough Set Modeling. 37-50 - Marek A. Bednarczyk, Wojciech Jamroga, Wieslaw Pawlowski:
Expressing and Verifying Temporal and Structural Properties of Mobile Agents. 51-63 - Piotr Chrzastowski-Wachtel:
Determining Sound Markings in Structured Nets. 65-79 - Ludwik Czaja:
Equations for message passing. 81-93 - Anatoly E. Doroshenko, Ruslan Shevchenko:
A Rewriting Framework for Rule-Based Programming Dynamic Applications. 95-108 - Berndt Farwer, Michael Köhler:
Modelling Global and Local Name Spaces for Mobile Agents Using Object Nets. 109-122 - Berndt Farwer, Mauricio Varea:
Separation of Control and Data Flow in High-Level Petri Nets: Transforming Dual Flow Nets into Object Petri Nets. 123-137 - Anna Gomolinska:
Possible Rough Ingredients of Concepts in Approximation Spaces. 139-154 - Franciszek Grabowski, Dominik Strzalka:
Dynamic Behavior of Simple Insertion Sort Algorithm. 155-165 - Damas P. Gruska:
Network Information Flow. 167-180 - Agata Janowska, Pawel Janowski:
Slicing of Timed Automata with Discrete Data. 181-195 - Magdalena Kacprzak:
A Strong Completeness Result for a MAS Logic. 197-213 - Magdalena Kacprzak, Alessio Lomuscio, Artur Niewiadomski, Wojciech Penczek, Franco Raimondi, Maciej Szreter:
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol. 215-234 - Barbara Klunder:
Star-Connected Flat Languages and Automata. 235-243 - Michael Köhler, Heiko Rölke:
Properties of Super-Dual Nets. 245-254 - Manfred Kudlek:
On Quantum Vector Addition Systems. 255-261 - Miroslaw Kurkowski, Marian Srebrny:
A Quantifier-free First-order Knowledge Logic of Authentication. 263-282 - Agnieszka Nowak, Alicja Wakulicz-Deja, Sebastian Bachlinski:
Optimization of Speech Recognition by Clustering of Phones. 283-293 - Trung Thanh Nguyen, Claire P. Willis, Derek J. Paddon, Sinh Hoa Nguyen, Hung Son Nguyen:
Learning Sunspot Classification. 295-309 - Edward Ochmanski, Joanna Pieckowska:
Trace Nets and Conflict-free Computations. 311-321 - Edward Ochmanski, Krystyna Stawikowska:
Star-free Star and Trace Languages. 323-331 - Roman R. Redziejowski:
Associative Omega-product of Processes. 333-345 - Nikolay V. Shilov, Natalya Olegovna Garanina, K.-M. Choe:
Update and Abstraction in Model Checking of Knowledge and Branching Time. 347-361 - Andrzej Skowron, Jaroslaw Stepaniuk, James F. Peters, Roman W. Swiniarski:
Calculi of Approximation Spaces. 363-378 - Jerzy Stefanowski, Szymon Wilk:
Rough Sets for Handling Imbalanced Data: Combining Filtering and Rule-based Classifiers. 379-391 - Zbigniew Suraj, Neamat El Gayar, Pawel Delimata:
A Rough Set Approach to Multiple Classifier Systems. 393-406 - Józef Winkowski:
An Axiomatic Characterization of Algebras of Processes of Petri Nets. 407-420 - Marcin Wolski:
Complete Orders, Categories and Lattices of Approximations. 421-435
Volume 72, Number 4, 2006
- Simon Collings, Ryszard Kozera, Lyle Noakes:
Surface Properties from N-Views of a Strictly Convex Solid. 437-452 - Kimmo Fredriksson:
On-line Approximate String Matching in Natural Language. 453-466 - Andrei Paun, Bianca Popa:
P Systems with Proteins on Membranes. 467-483 - Petros Potikas, Panos Rondogiannis, Manolis Gergatsoulis:
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs. 485-527 - Haifeng Shen, Qunxia Li, Jun Guo, Gang Liu:
Model-Based Feature Compensation for Robust Speech Recognition. 529-539
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.