Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
We characterize the dynamic data management problem for location based services(LBS) in mobile environments and devise a cost model for servicing both location independent and loc...
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
Wei Chen, Dayu Huang, Ankur A. Kulkarni, Jayakrish...
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...