Design Computing and Cognition '18 2019
DOI: 10.1007/978-3-030-05363-5_5
|View full text |Cite
|
Sign up to set email alerts
|

A Comparison of Tree Search Methods for Graph Topology Design Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…genetic algorithms [20], and tree search methods [21][22][23][24] solve an isolated optimization task offering no transfer of strategies or experience across analogous problems. More recently, generative models [25][26][27] and reinforcement learning [28][29][30] methods have been developed to 4 leverage experience; however, these works find the highest performing design in particular problems with no focus on transferability or generalizability.…”
mentioning
confidence: 99%
“…genetic algorithms [20], and tree search methods [21][22][23][24] solve an isolated optimization task offering no transfer of strategies or experience across analogous problems. More recently, generative models [25][26][27] and reinforcement learning [28][29][30] methods have been developed to 4 leverage experience; however, these works find the highest performing design in particular problems with no focus on transferability or generalizability.…”
mentioning
confidence: 99%