12 citations · 21 across the 4 of their papers we have counts for
5 papers
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis
Xu T. Liu, Jesun Firoz, Sinan Aksoy +5
Hypergraphs offer flexible and robust data representations for many applications, but methods that work directly on hypergraphs are not readily available and tend to be prohibitive…
Reinforcement Learning for Battery Energy Storage Dispatch augmented with Model-based Optimizer
Gayathri Krishnamoorthy, Anamika Dubey
Reinforcement learning has been found useful in solving optimal power flow (OPF) problems in electric power distribution systems. However, the use of largely model-free reinforceme…
Lucid Dreaming for Experience Replay: Refreshing Past States with the Current Policy
Yunshu Du, Garrett Warnell, Assefaw Gebremedhin +2
Experience replay (ER) improves the data efficiency of off-policy reinforcement learning (RL) algorithms by allowing an agent to store and reuse its past experiences in a replay bu…
What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks
Ryan A. Rossi, David F. Gleich, Assefaw H. Gebremedhin +1
Exact maximum clique finders have progressed to the point where we can investigate cliques in million-node social and information networks, as well as find strongly connected compo…
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin +2
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, informatics, and many other areas. Although there exist several algor…