A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Filters
Multi-robot exploration and rendezvous on graphs
2012
2012 IEEE/RSJ International Conference on Intelligent Robots and Systems
Preserved Fulltext
We evaluate the time taken to rendezvous by varying a set of conditions including: world size, number of robots, starting location of each robot and the presence of sensor noise. ...
This ranking criterion associates a cost for visiting a rendezvous location and gives an expected reward of finding other agents. ...
the connectivity of the graph. ...
doi:10.1109/iros.2012.6386049
dblp:conf/iros/MeghjaniD12
fatcat:ei4blmzehbfbngcmkpctbqqvt4
Data-driven traffic and diffusion modeling in peer-to-peer networks: A real case study
2014
Network 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.
We observe however a saturation of this phenomenon after 65% of free-riders. * ...
of peers that do not share content (i.e., free riders) or the distribution of the files among the peers, and its high-level properties, such as the Quality of Service or the diffusion of content, which ...
In this graph, two peers will be connected at time t > 0 if they share a common interest (as in the interest graph) and if they are both online at time t. ...
doi:10.1017/nws.2014.23
fatcat:pealgoboxje3vopudwdwdj2w3q
Pingmesh
2015
Computer communication review
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.
Pingmesh has been running in Microsoft data centers for more than four years, and it collects tens of terabytes of latency data per day. ...
When an application A at a server sends a message to an application B at a peer server, the network latency is defined as the time interval from the time A sends the message to the time B receives the ...
We would like to note that the TCP source port of the Pingmesh Agent varies for every probing. ...
doi:10.1145/2829988.2787496
fatcat:tsfgh5c2jvf2bd3hc4chc7etpu
Pingmesh
2015
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication - SIGCOMM '15
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.
Can we get network latency between any two servers at any time in large-scale data center networks? ...
Pingmesh has been running in Microsoft data centers for more than four years, and it collects tens of terabytes of latency data per day. ...
We would like to note that the TCP source port of the Pingmesh Agent varies for every probing. ...
doi:10.1145/2785956.2787496
dblp:conf/sigcomm/GuoYXDHMLWPCLK15
fatcat:hqmqji4tsbhcffo2lyfhz2f4hu
Endotaxis: A Universal Algorithm for Mapping, Goal-Learning, and Navigation
[article]
2021
bioRxiv
pre-print
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.
Here we propose an algorithm that learns the structure of an arbitrary environment, discovers useful targets during exploration, and navigates back to those targets by the shortest path. ...
This endotaxis algorithm can be implemented with a simple 3-layer neural circuit using only biologically realistic structures and learning rules. ...
In any state of the game there are either 2 or 3 possible actions, and they form an interesting graph with many loops (Fig 3A iii). Again the simulated agent explored this graph by random walking. ...
doi:10.1101/2021.09.24.461751
fatcat:rss47fhdgra23f3gqxpedaahgi
Complex behavior in a network with time-dependent connections and silent nodes
2008
Journal of Statistical Mechanics: Theory and Experiment
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.
Other Versions
We studied, both analytically and numerically, complex excitable networks, in which connections are time dependent and some of the nodes remain silent at each time step. ...
More specifically, (a) there is a heterogenous distribution of connection weights and, depending on the current degree of order, some connections are reinforced/weakened with strength Phi on short-time ...
Acknowledgments We acknowledge very useful discussions with S de Franciscis, and financial support from FEDER-MEC project FIS2005-00791, JA project P06-FQM-01505 and EPSRC-COLAMN project EP/CO 10841/1. ...
doi:10.1088/1742-5468/2008/02/p02017
fatcat:jhmevlovl5dzfjdnmrojpqangu
Forging a morphological system out of two dimensions: Agentivity and number
2015
Open Linguistics
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.
Sign Languages (ASL and LIS), and hearing individuals asked to gesture silently. ...
We find another feature – unpunctuated repetition – in the sign systems (ASL, LIS, NSL, Homesign) but not in silent gesture. ...
to Multiple vignettes with an agent (right graph) and without an agent (left graph). ...
doi:10.1515/opli-2015-0021
fatcat:3rdpvha5wvhxtjouxybi7rz67q
Learning Connectivity for Data Distribution in Robot Teams
[article]
2021
arXiv
pre-print
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 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We also show that the trained policies generalize to larger teams of both static and mobile agents. ...
To do this, agents glean information about the topology of the network from packet transmissions and feed it to a GNN running locally which instructs the agent when and where to transmit the latest state ...
Team positions were reinitialized until the communication graph had algebraic connectivity at the initial timestep, assuming a disk communication model with a range of 250 m. ...
arXiv:2103.05091v2
fatcat:v5qedkge7jc5pnowrfm6ydvmri
Multiagent Connected Path Planning: PSPACE-Completeness and How to Deal With It
2018
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE 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 2022; you can also visit the original URL.
The file type is application/pdf.
In the Multiagent Connected Path Planning problem (MCPP), a team of agents moving in a graph-represented environment must plan a set of start-goal joint paths which ensures global connectivity at each ...
time step, under some communication model. ...
However, we can easily enforce the connectedness of G E with the help of some dummy vertices linking the different connected components to each other. ...
doi:10.1609/aaai.v32i1.11587
fatcat:ck7gp5lsqvhjpjybsr2o3tljyi
Self-Organizing Hierarchies in Sensor and Communication Networks
2005
Artificial Life
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.
Spatiotemporal robustness of self-organizing hierarchies is quantitatively measured with graph-theoretic and information-theoretic techniques, such as the Shannon entropy. ...
In particular, we investigate self-organization of impact boundaries enclosing critically damaged areas, and impact networks connecting remote cells that have detected noncritical impacts. ...
The authors are grateful to other members of the AAV project, GREM Lab ...
doi:10.1162/106454605774270642
pmid:16197671
fatcat:o3m3qccvqbeqnnihzibrxjsecu
Private-Public Opinion Discrepancy
2020
PLoS ONE
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 2021; you can also visit the original URL.
The file type is application/pdf.
We characterized these different types of agents by different decision rules for either voicing their opinion or remaining silent, based on the behavior of their proximal network. ...
The present paper presents an agent-based model of how such discrepancies between public opinion and private attitudes develop at the scale of micro-societies. ...
Franco Bagnoli for the precious revision of the paper and software. ...
doi:10.1371/journal.pone.0242148
pmid:33237944
pmcid:PMC7688181
fatcat:a7wlnzgvwzawvks3hkt4ifj4xq
Homogeneous assumption and the logistic behavior of information propagation
2012
Physical Review E
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.
These findings lead to a general result on the logistic behavior of information propagation for networks on both connected graphs with doubly stochastic edge weights, and connected graphs with symmetric ...
For these types of models, we determine how close the coarse approximation is to its corresponding agent-based system. ...
In general, each a ij is a time-varying expression since the graph topology of a given social network is subject to change over long enough periods of time. ...
doi:10.1103/physreve.85.026102
pmid:22463274
fatcat:r3dc4zan7nbfxe4zeehthkchue
Bribery games on inter-dependent regular networks
2017
Scientific Reports
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.
We investigate the effect of varying bribe demand made by corrupt officials and the cost of complaining incurred by harassed citizens, on the proliferation of corrupt strategies in the population. ...
Our results reveal the important role of network structure and connectivity in asymmetric games. ...
Discussion We explored the effect of network connectivity on the prevalence of bribery in a structured population characterized as an inter-dependent regular network. ...
doi:10.1038/srep42735
pmid:28205644
pmcid:PMC5311942
fatcat:viums644tne6tbbv75cisn4vr4
Can Artificial Life Emerge in a Network of Interacting Agents?
2006
2006 IEEE International Conference on Fuzzy 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 2011; you can also visit the original URL.
The file type is application/pdf.
However,the quantitative understanding of a Smart system with an arbitrary interactive topology is extremely difficult. Hence we cannot design a general purpose programmable Smart system. ...
We explain how these basic properties can arise among agents through random enabling, inhibiting, preferential attachment and growth of a multiagent system. ...
Thus quantitative understanding of a Smart system using the above parameters with arbitrary time varying interactive topology seems not possible. ...
doi:10.1109/fuzzy.2006.1681702
dblp:conf/fuzzIEEE/MurthyK06
fatcat:cqcyo4nm4jb4lmvd7q72kcjrxq
A Computational Approach to Homans Social Exchange Theory
[article]
2020
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
That is, each agent transacts with familiar agents based on his previous history with them and transacts with newly found agents through exploration. ...
To do so, Based on Homans' prepositions, we provide the opportunity for each agent to exchange with other agents. ...
An agent at each given time has to choose whether he wants to transact with his known agents (we call them neighbors) or try to explore someone new. ...
arXiv:2007.14953v1
fatcat:ntrtaezvozcjffd6bqoijl2qdm
« Previous
Showing results 1 — 15 out of 9,307 results