Difference between revisions of "Subir Bhattacharya"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 17: | Line 17: | ||
* [[Subir Bhattacharya]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Experimenting-with-Revisits-in-Game-Tree-Search-Bhattacharya/e66607a46c44a59f0763e4b5a627b202193dc14e Experimenting with Revisits in Game Tree Search]''. [[Conferences#IJCAI1995|IJCAI 1995]] | * [[Subir Bhattacharya]] ('''1995'''). ''[https://www.semanticscholar.org/paper/Experimenting-with-Revisits-in-Game-Tree-Search-Bhattacharya/e66607a46c44a59f0763e4b5a627b202193dc14e Experimenting with Revisits in Game Tree Search]''. [[Conferences#IJCAI1995|IJCAI 1995]] | ||
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1996'''). ''[https://www.aaai.org/Library/AAAI/1996/aaai96-033.php Searching Game Trees Under Memory Constraints]''. [[Conferences#AAAI-96|AAAI-96]] | * [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1996'''). ''[https://www.aaai.org/Library/AAAI/1996/aaai96-033.php Searching Game Trees Under Memory Constraints]''. [[Conferences#AAAI-96|AAAI-96]] | ||
| − | * [https://dblp.uni-trier.de/pers/hd/n/Nazareth:Terence Terence Nazareth], [[Mathematician#SVerma| | + | * [https://dblp.uni-trier.de/pers/hd/n/Nazareth:Terence Terence Nazareth], [[Mathematician#SVerma|Sanjay Verma]], [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1999'''). ''[https://www.semanticscholar.org/paper/The-multiple-resource-constrained-project-problem%3A-Nazareth-Verma/4de0a88cac15288e8086ee708360f2e3dbd519eb The multiple resource-constrained project scheduling problem: A breadth-first approach]''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 112, No. 1 |
==2000 ...== | ==2000 ...== | ||
* [[Subir Bhattacharya]], [https://dblp.uni-trier.de/pers/hd/b/Bose:Sumit_Kumar Sumit K. Bose] ('''2007'''). ''[https://ideas.repec.org/a/eee/ejores/v182y2007i1p1-14.html Mathematical model for scheduling operations in cascaded continuous processing units]''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 182, No. 1 | * [[Subir Bhattacharya]], [https://dblp.uni-trier.de/pers/hd/b/Bose:Sumit_Kumar Sumit K. Bose] ('''2007'''). ''[https://ideas.repec.org/a/eee/ejores/v182y2007i1p1-14.html Mathematical model for scheduling operations in cascaded continuous processing units]''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 182, No. 1 | ||
Revision as of 20:15, 22 July 2019
Home * People * Subir Bhattacharya
Subir Bhattacharya [1]
Subir Bhattacharya,
an Indian computer scientist and professor at Department of Management Information Systems, Indian Institute of Management, Calcutta. He holds a Ph.D. from University of Calcutta in 1990 under Amitava Bagchi, and researched on search algorithms. They investigated Stockman's SSS*, and proposed a recursive implementation, called RecSSS*.
Contents
Selected Publications
1986 ...
- Subir Bhattacharya, Amitava Bagchi (1986). Making Best Use of Available Memory when Searching Game Trees. AAAI-86
- Subir Bhattacharya, Amitava Bagchi (1989). Searching Game Trees in Parallel Using SSS. IJCAI 1989, pdf
1990 ...
- Subir Bhattacharya, Amitava Bagchi (1990). Unified Recursive Schemes for Search in Game Trees. Technical Report WPS-144, Indian Institute of Management, Calcutta
- Subir Bhattacharya, Amitava Bagchi (1992). QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies. IWAR 1992
- Subir Bhattacharya, Amitava Bagchi (1993). A Faster Alternative to SSS* with Extension to Variable Memory. Information Processing Letters, Vol. 47, No. 4
- Subir Bhattacharya (1995). Experimenting with Revisits in Game Tree Search. IJCAI 1995
- Subir Bhattacharya, Amitava Bagchi (1996). Searching Game Trees Under Memory Constraints. AAAI-96
- Terence Nazareth, Sanjay Verma, Subir Bhattacharya, Amitava Bagchi (1999). The multiple resource-constrained project scheduling problem: A breadth-first approach. European Journal of Operational Research, Vol. 112, No. 1
2000 ...
- Subir Bhattacharya, Sumit K. Bose (2007). Mathematical model for scheduling operations in cascaded continuous processing units. European Journal of Operational Research, Vol. 182, No. 1
- Sumit K. Bose, Subir Bhattacharya (2008). A two pass heuristic algorithm for scheduling ‘Blocked Out’ units in continuous processing industry. Annals of Operations Research, Vol. 159, No. 1 [4]
- Sumit K. Bose, Subir Bhattacharya (2009). A State Task Network model for scheduling operations in cascaded continuous processing units. Computers and Chemical Engineering, Vol. 33, No. 1
2010 ...
- Ritesh Kumar, Subir Bhattacharya (2012). Cooperative Search Using Agents for Cardinality Constrained Portfolio Selection Problem. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, Vol. 42, No. 6
