default search action
Fundamenta Informaticae, Volume 71
Volume 71, Number 1, 2006
- Mariusz Flasinski, Edward Nawarecki, Lech Polkowski, Robert Schaefer, Jerzy Stefanowski, Zbigniew Suraj:
Preface. - Mariusz Flasinski, Janusz Jurek:
On the Analysis of Fuzzy String Patterns with the Help of Extended and Stochastic GDPLL(k) Grammars. 1-14 - Marek Grochowski, Robert Schaefer, Maciej Smolka:
Architectural Principles and Scheduling Strategies for Computing Agent Systems. 15-26 - Jaroslaw Kozlak, Jean-Charles Créput, Vincent Hilaire, Abder Koukam:
Multi-agent Approach to Dynamic Pick-up and Delivery Problem with Uncertain Knowledge about Future Transport Demands. 27-36 - Edward Nawarecki, Marek Kisiel-Dorohinicki, Grzegorz Dobrowolski:
Architecture for Discovery of Crises in MAS. 37-47 - Lech Polkowski:
A Set Theory for Rough Sets. Toward A Formal Calculus of Vague Statements. 49-61 - Jerzy Stefanowski:
An Empirical Study of Using Rule Induction and Rough Sets to Software Cost Estimation. 63-82 - Zbigniew Suraj, Barbara Fryc:
Timed Approximate Petri Nets. 83-99 - Zbigniew Suraj, Barbara Fryc, Zofia Matusiewicz, Krzysztof Pancerz:
A Petri Net System - an Overview. 101-120 - Zbigniew Suraj, Krzysztof Pancerz:
Reconstruction of Concurrent System Models Described by Decomposed Data Tables. 121-137
Volume 71, Number 2-3, 2006
- Mohua Banerjee:
Logic for Rough Truth. 139-151 - Jan A. Bergstra, Cornelis A. Middelburg:
Thread Algebra with Multi-Level Strategies. 153-182 - Francesco Calimeri
, Wolfgang Faber, Gerald Pfeifer, Nicola Leone:
Pruning Operators for Disjunctive Logic Programming Systems. 183-214 - Chin-Chen Chang, Guei-Mei Chen, Yu-Chen Hu:
A Novel Index Coding Scheme for Vector Quantization. 215-227 - Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc:
Complexity of Searching for a Black Hole. 229-242 - Kees M. van Hee, Natalia Sidorova, Marc Voorhoeve:
Resource-Constrained Workflow Nets. 243-257 - Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis:
The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. 259-277 - Mihai Ionescu, Gheorghe Paun, Takashi Yokomori:
Spiking Neural P Systems. 279-308 - Karel De Loof, Hans E. De Meyer, Bernard De Baets:
Exploiting the Lattice of Ideals Representation of a Poset. 309-321 - James F. Peters, Christopher J. Henry:
Reinforcement Learning with Approximation Spaces. 323-349 - Ming-Ni Wu, Chia-Chen Lin, Chin-Chen Chang:
A Robust Content-Based Copy Detection Scheme. 351-366
Volume 71, Number 4, 2006
- Gregory J. Chaitin:
Probability and Program-Size for Functions. 367-370 - Henning Christiansen, Davide Martinenghi:
On Simplification of Database Integrity Constraints. 371-417 - Norihiro Kamide:
Foundations of Paraconsistent Resolution. 419-441 - Chia-Chen Lin, Yu-Chen Hu, Chin-Chen Chang:
A Novel Image Ownership Protection Scheme Based on Rehashing Concept and Vector Quantization. 443-451 - Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin:
A Formal Language Analysis of DNA Hairpin Structures. 453-475 - Michael Winter:
On Problems in Polymorphic Object-Oriented Languages With Self Types and Matching. 477-491 - Sheng Zhong:
An Efficient and Secure Cryptosystem for Encrypting Long Messages. 493-497
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.
last updated on 2025-01-06 23:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: