Search Results for author:
Found 4 papers, 2 papers with code
Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search
Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem.
Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search
Graph neural networks are useful for learning problems, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem.
Computing Steiner Trees using Graph Neural Networks
Graph neural networks have been successful in many learning problems and real-world applications.
AgentBuddy: A Contextual Bandit based Decision Support System for Customer Support Agents
In this short paper, we present early insights from a Decision Support System for Customer Support Agents (CSAs) serving customers of a leading accounting software.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
