A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Modelling shared state in a shared action model
[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
Preserved Fulltext
From the construction of steps(B), a shared memory action 7r E act(B) is enabled in state s of B only if 7iXY is enabled in state s of A. ...
We define a special class of actions, called "shared memory actions," to model atomic accesses to shared memory. ...
doi:10.1109/lics.1990.113769
dblp:conf/lics/GoldmanL90
fatcat:wmwgpjibevdlbfm3xv2qrivvry
Reinforcement Learning with Multiple Shared Rewards
2016
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A major concern in multi-agent coordination is how to select algorithms that can lead agents to learn together to achieve certain goals. ...
This paper proposes an approach based on the integration of multi-agent coordination models designed for reward-sharing policies. ...
action a in state s. ...
doi:10.1016/j.procs.2016.05.376
fatcat:dfbmm5mskjhrndfzlbvrz73hse
Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach
2013
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A general model of decentralized stochastic control called partial history sharing information structure is presented. ...
In this model, at each step the controllers share part of their observation and control history with each other. ...
POMDP Model: A partially observable Markov decision process consists of a state process , an observation process , an action process , , and a single decision-maker where: 1) The action at time is chosen ...
doi:10.1109/tac.2013.2239000
fatcat:wpty3567irgg7cbru4t4q7bhja
A Hybrid Interaction Model for Multi-Agent Reinforcement Learning
2016
Proceedings of the 18th International Conference on Enterprise Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The interaction models are based on the sharing of rewards for learning with multiple agents in order to discover interactively good quality policies. ...
From these concepts, the hybrid method uses the characteristics of each model, reducing possible conflicts between different policy actions with rewards, improving the coordination of agents in reinforcement ...
action a in state s. ...
doi:10.5220/0005832300540061
dblp:conf/iceis/GuisiRTBDE16
fatcat:423um2czi5ffjiscqn6wg65sra
"Slow Is Fast" for Wireless Sensor Networks in the Presence of Message Losses
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
To address this problem, we propose a variation of the shared memory model, the SF shared memory model, where the actions of each node are partitioned into slow actions and fast actions. ...
The traditional shared memory model consists only of fast actions and a lost message can disable the nodes from execution. ...
Similar to the shared memory model, in the SF shared memory model, in each step, a node is allowed to read the state of its neighbors and write its own state. ...
doi:10.1007/978-3-642-16023-3_16
fatcat:n4pvos4r3vbvjfvl572xaigzne
"Slow is Fast" for wireless sensor networks in the presence of message losses
2015
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
To address this problem, we propose a variation of the shared memory model, the SF shared memory model, where the actions of each node are partitioned into slow actions and fast actions. ...
The traditional shared memory model consists only of fast actions and a lost message can disable the nodes from execution. ...
Similar to the shared memory model, in the SF shared memory model, in each step, a node is allowed to read the state of its neighbors and write its own state. ...
doi:10.1016/j.jpdc.2014.11.004
fatcat:p5ghawdorfdkvm4qm4bwl6f5ye
Biological and Computational Perspectives on the Emergence of Social Phenomena: Shared Understanding and Collective Power
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Having knowledge about these mechanisms in a biological context provides a basis to modelling corresponding mechanisms in a compuational setting. ...
Apparently, specific mechanisms are required to tune the individual mental processes to each other in order to enable the emergence of shared mental states and collective behaviour. ...
In this area it may be analysed in what way the above perspective provides possibilities that differ compared to already existing approaches. ...
doi:10.1007/978-3-642-34645-3_8
fatcat:2aftdrduwndwbke6kwdtaemf7m
A Task-Centric Memory Model for Scalable Accelerator Architectures
2010
IEEE Micro
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The Cooperative Shared Memory model 17 is similar to Rigel; it relies on software to properly label shared accesses for performance and achieves scalable performance using a reducedcomplexity hardware ...
the support of the Focus Center for Circuit & Systems Solutions (C2S2) and the Gigascale Systems Research Center (GSRC), two of the five research centers funded under the Focus Center Research Program, a ...
T X denotes the set of tasks sharing a block in state X. The model disallows any transition absent from the diagram. and 5). ...
doi:10.1109/mm.2010.6
fatcat:wzxeuc4yrvajbg7jv4jatdagya
A High-Level Reference Model for Reusable Object-Level Coordination Support in Groupware Applications
2007
15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
objects in a collaborative setting. ...
In addition to detailing the proposed reference model, the paper also illustrates and discusses both potential ways of using it. ...
Those policy examples simply intend to cover cases in which all reference model elements are involved at least once. execute an action on a shared object. ...
doi:10.1109/pdp.2007.9
dblp:conf/pdp/Gomez-HernandezAGBD07
fatcat:5u64pkzknngixblutvbesk3co4
Page 378 of Computational Linguistics Vol. 21, Issue 3
[page]
1995
Computational Linguistics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In failing to represent such states, their model is unable to represent the intermediate states in which a hearer might have understood how the speaker’s utterance contributes to a plan, but doesn’t agree ...
They propose that agents are building a shared plan in which participants have a collection of beliefs and intentions about the actions in the plan. ...
Component Interfaces with Loosely Synchronous Communication
2021
2020 2nd International Conference on Societal Automation (SA)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
With LSIAs it is possible to check compatibility of interface models including safety-relevant properties like lifeness. In this paper we describe the composition of LSIAs and show examples. ...
This communication model is suitable to abstract the behaviour of many computing aspects with asynchronous communication between components. ...
With LSIA N 3 in state s 4 , M 1 and N 3 synchronise on the shared action a and transition to their respective state s 1 and s 6 . ...
doi:10.1109/sa51175.2021.9507118
fatcat:om4obnrj55hhvpcogiskeovnwe
Implementing a Stochastic Process Algebra within the Möbius Modeling Framework
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A formalism can be implemented in Möbius if a mapping can be provided to the Möbius Abstract Functional Interface, which includes a notion of state and a notion of how state changes over time. ...
The Möbius tool was built to provide multi-formalism multi-solution modeling, and allows the modeler to develop models in any supported formalism. ...
This means that the modeler will provide explicit guidance on exactly what state may be shared, and means that the modeler will create the PEPA model in such a way that the effect of a change in shared ...
doi:10.1007/3-540-44804-7_13
fatcat:vzb6ae6ujbehzktjb26wh6zgje
Optimal decentralized control of coupled subsystems with control sharing
2011
IEEE Conference on Decision and Control and European Control Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In many such applications the control actions are shared between different control stations giving rise to a control sharing information structure. ...
In this paper a three step solution approach for finite valued control actions is presented. ...
Embed the local observations in the control actions to Manuscript convert the control sharing model to a one-step delay sharing model, and then solve the latter system. ...
doi:10.1109/cdc.2011.6160970
dblp:conf/cdc/Mahajan11
fatcat:onqudn76trc7tac7jozfl5v44e
Optimal Decentralized Control of Coupled Subsystems With Control Sharing
2013
IEEE Transactions on Automatic Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In many such applications the control actions are shared between different control stations giving rise to a control sharing information structure. ...
In this paper a three step solution approach for finite valued control actions is presented. ...
Embed the local observations in the control actions to Manuscript convert the control sharing model to a one-step delay sharing model, and then solve the latter system. ...
doi:10.1109/tac.2013.2251807
fatcat:cv5knqpd25hltcc6angc7kf7xq
Benign failure models for shared memory
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
These results are cited as evidence that the crash-omission failure model may be an appropriate choice to consider in the formulation of a more extensive theory of fault-tolerant shared objects. ...
This paper introduces two benign failure models for shared memory in distributed systems, crash-omission and crash-eventual. ...
In this model, a shared memory object suffers a failure of type crash-omission if operations concurrent with the crash may respond with a special "?" ...
doi:10.1007/3-540-57271-6_28
fatcat:hstirnmb7nhtxjhrw4ksvmgmme
« Previous
Showing results 1 — 15 out of 1,739,593 results