FUIN 2008 - PDF Preprint Papers

FUIN 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FUIN-2008 Paper

click to vote

FUIN
2008

177views more FUIN 2008»

A Multi-facet Approach to Dynamic Agent Systems

14 years 1 months ago

Download www.ipipan.gda.pl

We are concerned with the problem of defining a complex, hybrid, agent based discrete system in a modular way. The modularity results from looking at the system from a number of di...

Marek A. Bednarczyk, Wieslaw Pawlowski, Luca Berna...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	177	A Multi-facet Approach to Dynamic Agent Systems	claim
2	147	A Basic Logic for Reasoning about Connector Reconfiguration	claim
3	142	Relational Transformation-based Tagging for Activity Recognition	claim
4	136	Multi-Dimensional Relational Sequence Mining	claim
5	128	Impact of Asynchrony on the Behavior of Rational Selfish Agents	claim
6	124	Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity	claim
7	123	Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata	claim
8	119	Modeling Communication with Synchronized Environments	claim
9	116	Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web	claim
10	116	On the Relationship between Description Logic-based and F-Logic-based Ontologies	claim
11	112	A New Probabilistic Approach for Fractal Based Image Compression	claim
12	108	A Simple Proof of Miller-Yu Theorem	claim
13	108	Radial View of Continuous Cellular Automata	claim
14	108	Learning Ground CP-Logic Theories by Leveraging Bayesian Network Learning Techniques	claim
15	107	Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets	claim
16	107	Nondeterminism in Constructive Z	claim
17	103	Implementing Sorting Networks with Spiking Neural P Systems	claim
18	103	LDYIS: a Framework for Model Checking Security Protocols	claim
19	102	Some Aspects of Parsing Expression Grammar	claim
20	101	Translation of Intermediate Language to Timed Automata with Discrete Data	claim
21	100	Alias Types and Effects for "Environment-aware" Computations	claim
22	99	Universality Analysis for One-Clock Timed Automata	claim
23	99	Effective Prediction of Web User Behaviour with User-Level Models	claim
24	98	A Restarted Strategy for Efficient Subsumption Testing	claim
25	96	Computational Efficiency of Intermolecular Gene Assembly	claim
26	94	On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets	claim
27	93	Logic-based Conflict Detection for Distributed Policies	claim
28	93	An Algebraic Framework for Defining Random Concurrent Behaviours	claim
29	92	Translation of Timed Promela to Timed Automata with Discrete Data	claim
30	91	A Deductive Proof System for Multithreaded Java with Exceptions	claim
31	90	Applications of Kolmogorov Complexity and Universal Codes to Nonparametric Estimation of Characteristics of Time Series	claim
32	89	Is Timed Branching Bisimilarity a Congruence Indeed?	claim
33	89	A Foundational Theory of Contracts for Multi-party Service Composition	claim
34	89	Editing Configurations of P Systems	claim
35	88	Validating Behavioral Component Interfaces in Rewriting Logic	claim
36	88	Learning from Skewed Class Multi-relational Databases	claim
37	88	Preferential Regular Path Queries	claim
38	83	Fault Diagnosis with Static and Dynamic Observers	claim
39	82	Nuovo DRM Paradiso: Designing a Secure, Verified, Fair Exchange DRM Scheme	claim
40	81	A Cancellation Theorem for BCCSP	claim
41	81	On the Use of Behavioural Equivalences for Web Services' Development	claim
42	80	Products of Tree Automata with an Application to Temporal Logic	claim
43	80	An Algorithmic Solution of a Birkhoff Type Problem	claim
44	80	External Memory Algorithms for String Problems	claim
45	80	Complete Process Semantics of Petri Nets	claim
46	76	Prescribed Learning of Indexed Families	claim
47	74	A P Systems Flat Form Preserving Step-by-step Behaviour	claim
48	74	Security in a Model for Long-running Transactions	claim
49	73	On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic	claim
50	72	Working with the Past: Integrating History in Petri Nets	claim
51	72	Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics	claim
52	71	Nonterminal Complexity of Some Operations on Context-Free Languages	claim
53	57	Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)	claim
54	57	The Halting Probability via Wang Tiles	claim
55	56	Representing Uncertainty in RuleML	claim
56	56	Specification and Verification of Invariants by Exploiting Layers in OO Designs	claim
57	54	Partial Conway and Iteration Semirings	claim
58	54	Optimization in Discovery of Compound Granules	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers