From 7dac2ee66ede34484b23a22e843747a37181e7f0 Mon Sep 17 00:00:00 2001 From: AntonReinhard Date: Thu, 5 Sep 2024 11:40:08 +0200 Subject: [PATCH 1/2] Add pledge and author --- Project.toml | 2 +- README.md | 4 ++++ 2 files changed, 5 insertions(+), 1 deletion(-) diff --git a/Project.toml b/Project.toml index e42bc39..8767991 100644 --- a/Project.toml +++ b/Project.toml @@ -1,6 +1,6 @@ name = "ComputableDAGs" uuid = "62933717-1c9d-4a3f-b06f-7ab7f17ca32d" -authors = ["AntonReinhard "] +authors = ["Anton Reinhard ", "Uwe Hernandez Acosta "] version = "0.1.0" [deps] diff --git a/README.md b/README.md index d68fab9..f436972 100644 --- a/README.md +++ b/README.md @@ -29,3 +29,7 @@ We assume we have a (valid) DAG given. We can generate all initially possible gr Goal: For some operation, regenerate possible operations after that one has been applied, but without having to copy the entire graph. This would be helpful for optimization algorithms to try paths of optimizations and build up tree structures, like for example chess computers do. Idea: Keep the original graph, a list of possible operations at the current state, and a queue of applied operations together. The "actual" graph is then the original graph with all operations in the queue applied. We can push and pop new operations to/from the queue, automatically updating the graph's global metrics and possible optimizations from there. + +## Pledge + +This work was partly funded by the Center for Advanced Systems Understanding (CASUS) that is financed by Germany’s Federal Ministry of Education and Research (BMBF) and by the Saxon Ministry for Science, Culture and Tourism (SMWK) with tax funds on the basis of the budget approved by the Saxon State Parliament. From 4d42a2ab7542dd986977a223a74cc86e1117965b Mon Sep 17 00:00:00 2001 From: Anton Reinhard Date: Thu, 5 Sep 2024 11:50:06 +0200 Subject: [PATCH 2/2] Update README.md Co-authored-by: Uwe Hernandez Acosta --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index f436972..405eef7 100644 --- a/README.md +++ b/README.md @@ -30,6 +30,6 @@ Goal: For some operation, regenerate possible operations after that one has been Idea: Keep the original graph, a list of possible operations at the current state, and a queue of applied operations together. The "actual" graph is then the original graph with all operations in the queue applied. We can push and pop new operations to/from the queue, automatically updating the graph's global metrics and possible optimizations from there. -## Pledge +## Acknowledgements and Funding This work was partly funded by the Center for Advanced Systems Understanding (CASUS) that is financed by Germany’s Federal Ministry of Education and Research (BMBF) and by the Saxon Ministry for Science, Culture and Tourism (SMWK) with tax funds on the basis of the budget approved by the Saxon State Parliament.