AI Summary: Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Por um escritor misterioso
Descrição
This paper studies the problem of finding graphs that maximize the number of edges, while avoiding short cycles. It formulates graph generation as a reinforcement learning task, and compares methods like AlphaZero and tabu search. A key finding is that using a curriculum - building larger graphs from good smaller graphs - significantly improves performance. The work makes progress on an open problem in extremal graph theory.
Aman Madaan (@aman_madaan) / X
A new hyper-heuristic based on ant lion optimizer and Tabu search algorithm for replica management in cloud environment
TransformerCVAE/data/arxiv/artificial intelligence_10047_15000_15_title.txt at master · fangleai/TransformerCVAE · GitHub
Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs
PDF] Adaptive Tabu Search for Traveling Salesman Problems
A memetic algorithm for finding multiple subgraphs that optimally cover an input network
Adam Zsolt Wagner
A new hyper-heuristic based on ant lion optimizer and Tabu search algorithm for replica management in cloud environment
Petar Veličković - CatalyzeX
Immunity-based Ebola optimization search algorithm for minimization of feature extraction with reduction in digital mammography using CNN models
AI-Local search&Nodeterministic Problems&Partial observations&Online search - 丹尼尔奥利瓦- 博客园
Petar Veličković - CatalyzeX
AI high: The island of Anguilla is riding the AI wave
Adversarial learning-based method for recognition of bionic and highly contextual underwater targets
de
por adulto (o preço varia de acordo com o tamanho do grupo)
