T. K. Satish Kumar
Author pages are created from data sourced from our academic publisher partnerships and public sources.
Multi-Agent Path Finding with Mutex Propagation
Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP
Many kinds of algorithms have been developed for solving the weighted constraint satisfaction problem (WCSP), a combinatorial optimization problem that frequently appears in AI. Unfortunately, its… Expand
Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP
Embedding Directed Graphs in Potential Fields Using FastMap-D
Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problems posed on… Expand
Nanotechnology - The invisible revolution?
The scientific revolution happened in the last two decades has given birth to a new branch called as nanoscience and nanotechnology. This new technology can now offer materials which can act like as… Expand