Simulation coercion applied to multiagent DDDAS

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The unpredictable run-time configurations of dynamic, datadriven application systems require flexible simulation components that can adapt to changes in the number of interacting components, the syntactic definition of their interfaces, and their role in the semantic definition of the entire system. Simulation coercion provides one solution to this problem through a human-controlled mix of semi-automated analysis and optimization that transforms a simulation to meet a new set of requirements posed by dynamic data streams. This paper presents an example of one such coercion tool that uses off-line experimentation and similarity-based lookup functions to transform a simulation to a reusable abstract form that extends a static feedback control algorithm to a dynamic, data-driven version that capitalizes on extended run-time data to improve performance. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Loitière, Y., Brogan, D., & Reynolds, P. (2004). Simulation coercion applied to multiagent DDDAS. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3038, 789–796. https://doi.org/10.1007/978-3-540-24688-6_102

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free