-
For example, component `A` depends on `B` and `C` but both `B` and `C` are independent and can take quite some time to initialize. Could Integrant start `B` and `C` concurrently instead of serially?
domkm updated
2 years ago
-
@vladimir-vg mentioned he wanted to store syntax as "JSON in text file... file tree in Git or tree in IPFS". I'm not sure about those last two, but it would made sense to standardize a JSON representa…
-
Let us discuss organization of fabstracts (folklore vs. no folklore) in a separate issue so that we can close #41.
I apologize for a rather long introduction, but I think we have a chance to try so…
-
I independently build a graph using jgrapht from the zenodo dataset, using a directed acyclic graph as target structure. There are three types of errors :
1. adding a new edge would induce a cycle
…
-
Hi,
I'm experimenting with adding a new page to the dashboard and adding a DAG (directional acyclic graph) flow to manually build the dependency job tree; i.e. with wait barrier where edges come in t…
-
Currently using a so-so correlation setup via XGBRegressor on time-lagged field-entries, 5 day windows. It's pretty bad theory, but works decent in practice. We'll want to move to something more solid…
-
There could be cases where we want to carry out a topological order traversal even if cycles are present.
For example, let's say we want all vertices to be sorted in topological order, just there cou…
-
I'm not sure that this should actually go into **bayesplot** but I figure the people who would be interested and able to do something like this would read **bayesplot** issues.
I think it would be …
-
1. First part of std::execution is c++17 stl execution policies. Can stl functions like std::transform be used by alpaka so that they use different backends.
2. New std::Execution includes sender/…
-
The new `ToplogicalSort()`, based on its `StableTopologicalSort()`, has really large performance degradation.
A program that used to take 42s, now takes 220-300s (sometimes more), with the vast maj…