Research and Publications:
  • Formal Verification of Hardware & Concurrent Systems
  • Heuristic Search in Artificial Intelligence
  • Distributed Computing

  •  

    Heuristic Search in Artificial Intelligence

    Heuristic search is a well studied paradigm for automated problem solving in Artificial Intelligence. As the use of domain specific knowledge is becoming increasingly important to contain the state space of real world problems, heuristic search offers well established tradeoffs between the accuracy of domain knowledge and the computational complexity of the problem. This is what makes heuristic search attractive in today's context.

    For details on our research in this area over the last ten years refer to the Artificial Intelligence Group home-page. My work is related to Multiobjective Heuristic Search and Agent Search.

    Book:

    1. Multiobjective Heuristic Search. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, Vieweg Verlag, 1999.
    Papers:
    1. Agent Searching in a tree and the optimality of Iterative Deepening. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, Artificial Intelligence, 71 (1994) 195-208.
    2. Multiobjective Heuristic Search of AND/OR Graphs. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, Journal of Algorithms, 20 (1996) 282-311.
    3. Utility of Pathmax in Partial Order Heuristic Search. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, Information Processing Letters, 55 (1995) 317-322.
    4. Searching Game Trees under a Partial Order. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, Artificial Intelligence, 82 (1996) 237-257.
    5. Agent Searching in Uniform b-ary Trees: Multiple Goals and Unequal Costs. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, Information Processing Letters, 58 (1996) 311-318.
    6. New results on Multiobjective State Space Search. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, Sadhana, 21, 3 (1996), 263-290.
    7. Solving constraint optimization problems from CLP-style specifications using heuristic search techniques. P.Dasgupta, P.P.Chakrabarti, Arnab Dey, S.Ghose and W.Bibel. To appear in IEEE Transactions on Knowledge and Data Engineering.
    8. A near optimal strategy for the extended cow-path problem in the presence of relative errors. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, In Lecture Notes on Computer Science, Springer Verlag, Vol 1026, Proceedings of the 15th FST & TCS conference (1995).
    9. A new competitive algorithm for Agent Searching in Unknown Streets. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar, In Lecture Notes on Computer Science, Springer Verlag, Vol 1180, Proceedings of the 16th FST & TCS conference (1996).
    10. Multiobjective Search in VLSI Design. P.Dasgupta, P.Mitra, P.P.Chakrabarti and S.C.DeSarkar, In VLSI'94, Proc. of 7th IEEE Int. Conf. on VLSI Design (1994).
    11. Heuristic search using multiple objectives. P.Dasgupta and P.P.Chakrabarti. In Proc. of 3rd National Seminar on Theoretical Computer Science, Kharagpur, India, pp 352-364.
    12. Game Tree Search under a Partial Order. P.Dasgupta, P.P.Chakrabarti and S.C.DeSarkar. In Proc. of 4th National Seminar on Theoretical Computer Science, Kanpur, India, pp 40-52.
    13. A Heuristic Search approach to effectively solve Constraint Optimization Problems from Logical Specifications. P.Dasgupta, P.P.Chakrabarti, A.Dey, S.Ghose, and W.Bibel. In Proc. of KBCS-98, Int. Conf. on Knowledge Based Computer Systems, 1998, 39-49.
    14. P.Dasgupta, P.P.Chakrabarti, Arnab Dey, S.Ghose and W.Bibel. Solving constraint optimization problems from CLP-style specifications using heuristic search techniques. IEEE Transactions in Knowledge and Data Engineering, 14 (2), 2002, 353-368
       
    Distributed Computing

    These are a few things related to distributed computing which I did out of pure curiosity.

    Papers:

    1. V_Thr: An Adaptive Load Balancing Algorithm. P. Dasgupta, A.K.Majumder and P.Bhattacharya. Journal of Par. and Dist. Computing, 42 (1997), 101-108.
    2. A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning. D.Das, P.Dasgupta and P.P.Das. Journal of Par. and Dist. Computing, 49 (1998), 169-181.
    3. Agreement under faulty interfaces. P. Dasgupta. Information Processing Letters, 65 (1997), 125-129.
    4. Adaptive algorithms for scheduling static task graphs in dynamic distributed systems. Prashanti Das, D.Das, and P.Dasgupta. In Proc. of HiPC'99, Lecture Notes in Computer Science, Vol 1745, 1999, 143-150.

    5.