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.
Filters
Explanation-Guided Fairness Testing through Genetic Algorithm
[article]
2022
arXiv
pre-print
Preserved Fulltext
Other Versions
This work proposes ExpGA, an explanationguided fairness testing approach through a genetic algorithm (GA). ...
The fairness characteristic is a critical attribute of trusted AI systems. A plethora of research has proposed diverse methods for individual fairness testing. ...
CONCLUSION This work proposes ExpGA, an explanation-guided method through the GA for software fairness testing. ...
arXiv:2205.08335v1
fatcat:kwcxbsoif5ct3cq4m4i77rwee4
Recent Advances in Fully Dynamic Graph Algorithms
[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
Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms. ...
In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. ...
For some classical dynamic algorithms, experimental studies have been performed, such as for fully dynamic graph clustering [80] and fully dynamic approximation of betweenness centrality [35] . ...
arXiv:2102.11169v5
fatcat:tcs3lkgcg5f7jax672adyzrstm
Faster Fully Dynamic Transitive Closure in Practice
2020
Symposium on Experimental and Efficient Algorithms
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.
In two large studies [Frigioni ea, 2001; Krommidas and Zaroliagis, 2008], a number of these algorithms have been evaluated experimentally against simple, static algorithms for graph traversal, showing ...
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and ...
The classic static algorithms BFS and DFS, which were competitive or even superior to the dynamic algorithms evaluated experimentally in previous studies, lagged far behind the new algorithms and were ...
doi:10.4230/lipics.sea.2020.14
dblp:conf/wea/HanauerH020
fatcat:upqg4kcgmjewfjbx4qaeft6dve
Experimental Validation of Consensus Algorithms for Multivehicle Cooperative Control
2008
IEEE Transactions on Control Systems Technology
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 2016; you can also visit the original URL.
The file type is application/pdf.
The experimental results show the effectiveness and robustness of the consensus algorithms even in the presence of platform physical limitations, packet loss, information delay, etc. ...
In this brief, consensus algorithms are experimentally implemented and validated on a mobile actuator and sensor network platform under directed, possibly switching interaction topologies to explore issues ...
Note that an undirected graph can be considered a special case of a directed graph, where an edge in the undirected graph corresponds to edges and in the directed graph. ...
doi:10.1109/tcst.2007.912239
fatcat:xlz55jwvkbalvlawlzlj2oxxbe
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
[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 2019; you can also visit the original URL.
The file type is application/pdf.
We present the rst experimental study of the fully dynamic single-source shortest paths problem in digraphs with arbitrary (negative and non-negative) arc weights. ...
The experiments also reveal that, although the simple dynamic algorithm we suggest is usually the fastest in practice, other dynamic algorithms proposed in the literature yield better results for speci ...
In this paper we make a step toward this direction and we present the rst experimental study of the fully dynamic single-source shortest paths problem in digraphs with arbitrary (negative and non-negative ...
doi:10.1007/3-540-44691-5_19
fatcat:xplom6xfmnb6rc3x6qzgltslnu
Experimental implementation and validation of consensus algorithms on a mobile actuator and sensor network platform
2007
2007 IEEE International Conference on Systems, Man and Cybernetics
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.
The experimental results show the effectiveness and robustness of the consensus algorithms even in the presence of platform physical limitations, packet loss, information delay, etc. ...
In this paper, we experimentally implement and validate distributed consensus algorithms on a mobile actuator and sensor network platform under directed, possibly switching interaction topologies to explore ...
Experimental implementation and validation of general consensus algorithms under a general (possibly directed switching) interaction topologies play an important role for studying distributed cooperative ...
doi:10.1109/icsmc.2007.4413882
dblp:conf/smc/RenCBSC07
fatcat:pgu4sij4qvge5iikqmbzwj4rpy
Implementations and Experimental Studies of Dynamic Graph Algorithms
[chapter]
2002
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 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we survey several implementations along with their experimental studies for dynamic problems on undirected and directed graphs. ...
We also discuss the design and implementation of a software library for dynamic graph algorithms. ...
The author is also indebted to Umberto Ferraro and Pino Italiano for various clarifications regarding their work. ...
doi:10.1007/3-540-36383-1_11
fatcat:yqoeyef7z5ayjhh4dw75wba5ra
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
[article]
2019
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1905.01216v1 fatcat:l3ohefaspvholkmpdrktioyphaOther Versions
In this paper, we bridge this gap by empirically studying an extensive set of algorithms for the single-source reachability problem in the fully dynamic setting. ...
lower bounds, there has been no experimental study that compares the performance of fully dynamic reachability algorithms in practice. ...
In this paper, we attempt to start bridging this gap by empirically studying an extensive set of algorithms for the single-source reachability problem in the fully dynamic setting. ...
arXiv:1905.01216v2
fatcat:z7b7wcziknaulpkoghktqtmuhy
Page 728 of Mathematical Reviews Vol. , Issue 85b
[page]
1985
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Author’s summary: “We present algorithms for maintaining a directed acyclic graph in a dynamically changing environment. In such an environment, nodes and edges are occasionally added and deleted. ...
The authors study the class of dags having an induced partial order of width 2 and propose a polynomial algorithm for this class when the partition into two paths is given. ...
Dynamic Physarum Solver: a bio-inspired shortest path method of dynamically changing graphs
2019
Turkish Journal of Electrical Engineering and Computer Sciences
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.
In dynamic graphs, edge weights of the graph change with time and solving the shortest path problem in such graphs is an important real-world problem. ...
In this paper, we propose a dynamic bio-inspired algorithm for finding the dynamic shortest path for large graphs based on Physarum Solver, which is a shortest path algorithm for static graphs. ...
We remark that the proposed algorithm automatically
Example 1 An example graph with six vertices
Experimental evaluation We present experimental results in terms of time and accuracy and compare them ...
doi:10.3906/elk-1811-46
fatcat:4c3tvftlc5bkjkaoaldc6zo6ye
Distributed Containment Control for Multiple Autonomous Vehicles With Double-Integrator Dynamics: Algorithms and Experiments
2011
IEEE Transactions on Control Systems Technology
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 2016; you can also visit the original URL.
The file type is application/pdf.
In the case of dynamic leaders, we study two cases: leaders with an identical velocity and leaders with nonidentical velocities. ...
This brief studies distributed containment control for double-integrator dynamics in the presence of both stationary and dynamic leaders. ...
An edge is undirected if implies . We use to denote the neighbor set of vehicle . A directed path is a sequence of edges in a directed graph of the form where . ...
doi:10.1109/tcst.2010.2053542
fatcat:archmsrs4bgxndefswuatsnqxi
Experimental analysis of dynamic all pairs shortest path algorithms
2006
ACM Transactions on Algorithms
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 present the results of an extensive computational study on dynamic algorithms for all pairs shortest path problems. ...
Our experimental data suggest that some of the dynamic algorithms and their algorithmic techniques can be really of practical value in many situations. ...
We are indebted to the anonymous referees for many useful comments. ...
doi:10.1145/1198513.1198519
fatcat:37uw7pjvrnbedmaczknnkk5n4q
Simulation and Experimental Study of Consensus Algorithms for Multiple Mobile Robots with Information Feedback
2008
Intelligent Automation and Soft 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 2016; you can also visit the original URL.
The file type is application/pdf.
and experimental studies of these strategies. ...
In this paper, we study the problem of consensus building in multi-robot systems with information feedback. ...
The authors would like to gratefully acknowledge Nathan Sorensen and Larry Ballard for their assistance in obtaining some of the simulation and experimental results in the paper. ...
doi:10.1080/10798587.2008.10642984
fatcat:l6lhvmlkzzcdflujeq56ot47hu
A Brief Survey on Distributed Graph Algorithms for Shortest Distance
2021
Zenodo
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.
There is an extended history of study in theoretical computer science faithful to designing proficient algorithms for graph problems. ...
Number of relative studies namely Graph pattern matching, Spatially Induced Linkage Cognizance (SILC), Snowball Algorithm, GREEDY-SNDOP, APSP and Efficient incremental algorithms are discussed and evaluate ...
Incremental
algorithms for DAG
(directed
acyclic
graphs) patterns.
The algorithms are
efficient and scale
well with the size of
data graphs, and with
the size of pattern
graphs. ...
doi:10.5281/zenodo.4738503
fatcat:jdpvyh3ujbdqpo3ca2kci3ypw4
Faster Fully Dynamic Transitive Closure in Practice
[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.
In two large studies [Frigioni ea, 2001; Krommidas and Zaroliagis, 2008], a number of these algorithms have been evaluated experimentally against simple static algorithms for graph traversal, showing the ...
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and ...
A dynamic graph is a directed graph G along with an ordered sequence of updates, which consist of edge insertions and deletions. ...
arXiv:2002.00813v1
fatcat:3jk5c4rf6zckfbrd4jkrvhhb6a
« Previous
Showing results 1 — 15 out of 214,790 results