25,161
edits
Changes
Created page with "'''Home * People * Subir Bhattacharya''' FILE:subir_bhattacharya.jpg|border|right|thumb|link=https://www.iimcal.ac.in/users/subir| Subir Bhattacharya <ref..."
'''[[Main Page|Home]] * [[People]] * Subir Bhattacharya'''
[[FILE:subir_bhattacharya.jpg|border|right|thumb|link=https://www.iimcal.ac.in/users/subir| Subir Bhattacharya <ref>[https://www.iimcal.ac.in/users/subir Prof. Subir Bhattacharya, Faculty Informations]</ref> ]]
'''Subir Bhattacharya''',<br/>
an Indian computer scientist and professor at Department of Management Information Systems, [http://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta].
Along with [[Amitava Bagchi]], Subir Bhattacharya researched on various [[Search|search]] algorithms and investigated [[George Stockman|Stockman's]] [[SSS* and Dual*|SSS*]].
With some improvements they came up with a [[Recursion|recursive]] implementation, called [[SSS* and Dual*#RecSSS|RecSSS*]].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/b/Bhattacharya:Subir dblp: Subir Bhattacharya]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==1986 ...==
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1986'''). ''[https://www.semanticscholar.org/paper/Making-Best-Use-of-Available-Memory-When-Searching-Bhattacharya-Bagchi/382a9878c5bcb72d760a48a3507e24eb64094853 Making Best Use of Available Memory when Searching Game Trees]''. [[Conferences#AAAI-86|AAAI-86]]
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1989'''). ''Searching Game Trees in Parallel Using SSS''. [[Conferences#IJCAI1989|IJCAI 1989]], [https://www.ijcai.org/Proceedings/89-1/Papers/007.pdf pdf]
==1990 ...==
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1990'''). ''Unified Recursive Schemes for Search in Game Trees''. Technical Report WPS-144, [https://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta]
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1992'''). ''[https://dlp5.acm.org/citation.cfm?id=664175 QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies]''. [https://dblp.uni-trier.de/db/conf/iwar/iwar1992.html IWAR 1992]
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1993'''). ''[https://dl.acm.org/citation.cfm?id=173194&preflayout=flat A Faster Alternative to SSS* with Extension to Variable Memory]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 47, No. 4
* [[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]]
* [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 ...==
* [[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
* [https://dblp.uni-trier.de/pers/hd/b/Bose:Sumit_Kumar Sumit K. Bose], [[Subir Bhattacharya]] ('''2008'''). ''[https://link.springer.com/article/10.1007/s10479-007-0265-2 A two pass heuristic algorithm for scheduling ‘Blocked Out’ units in continuous processing industry]''. [https://en.wikipedia.org/wiki/Annals_of_Operations_Research Annals of Operations Research], Vol. 159, No. 1 <ref>[https://en.wikipedia.org/wiki/Deterministic_global_optimization#Mixed-integer_non-linear_programming_problems_(MINLP) Mixed-integer non-linear programming problems (MINLP) - Wikipedia]</ref>
* [https://dblp.uni-trier.de/pers/hd/b/Bose:Sumit_Kumar Sumit K. Bose], [[Subir Bhattacharya]] ('''2009'''). ''[https://www.semanticscholar.org/paper/A-State-Task-Network-model-for-scheduling-in-units-Bose-Bhattacharya/72cac81a69297c9e7545ece660c48de6842cf5c6 A State Task Network model for scheduling operations in cascaded continuous processing units]''. [https://www.journals.elsevier.com/computers-and-chemical-engineering Computers and Chemical Engineering], Vol. 33, No. 1
==2010 ...==
* [[Mathematician#RiKumar|Ritesh Kumar]], [[Subir Bhattacharya]] ('''2012'''). ''[https://ieeexplore.ieee.org/document/6211438 Cooperative Search Using Agents for Cardinality Constrained Portfolio Selection Problem]''. [[IEEE#SMC|IEEE Transactions on Systems, Man, and Cybernetics]], Part C: Applications and Reviews, Vol. 42, No. 6
=External Links=
* [https://www.iimcal.ac.in/users/subir Prof. Subir Bhattacharya, Faculty Informations]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Bhattacharya]]
[[FILE:subir_bhattacharya.jpg|border|right|thumb|link=https://www.iimcal.ac.in/users/subir| Subir Bhattacharya <ref>[https://www.iimcal.ac.in/users/subir Prof. Subir Bhattacharya, Faculty Informations]</ref> ]]
'''Subir Bhattacharya''',<br/>
an Indian computer scientist and professor at Department of Management Information Systems, [http://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta].
Along with [[Amitava Bagchi]], Subir Bhattacharya researched on various [[Search|search]] algorithms and investigated [[George Stockman|Stockman's]] [[SSS* and Dual*|SSS*]].
With some improvements they came up with a [[Recursion|recursive]] implementation, called [[SSS* and Dual*#RecSSS|RecSSS*]].
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/b/Bhattacharya:Subir dblp: Subir Bhattacharya]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==1986 ...==
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1986'''). ''[https://www.semanticscholar.org/paper/Making-Best-Use-of-Available-Memory-When-Searching-Bhattacharya-Bagchi/382a9878c5bcb72d760a48a3507e24eb64094853 Making Best Use of Available Memory when Searching Game Trees]''. [[Conferences#AAAI-86|AAAI-86]]
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1989'''). ''Searching Game Trees in Parallel Using SSS''. [[Conferences#IJCAI1989|IJCAI 1989]], [https://www.ijcai.org/Proceedings/89-1/Papers/007.pdf pdf]
==1990 ...==
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1990'''). ''Unified Recursive Schemes for Search in Game Trees''. Technical Report WPS-144, [https://en.wikipedia.org/wiki/Indian_Institute_of_Management_Calcutta Indian Institute of Management, Calcutta]
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1992'''). ''[https://dlp5.acm.org/citation.cfm?id=664175 QuickGame: A Compromise Between Pure Depth-first and Pure Best-first Game Tree Search Strategies]''. [https://dblp.uni-trier.de/db/conf/iwar/iwar1992.html IWAR 1992]
* [[Subir Bhattacharya]], [[Amitava Bagchi]] ('''1993'''). ''[https://dl.acm.org/citation.cfm?id=173194&preflayout=flat A Faster Alternative to SSS* with Extension to Variable Memory]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 47, No. 4
* [[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]]
* [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 ...==
* [[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
* [https://dblp.uni-trier.de/pers/hd/b/Bose:Sumit_Kumar Sumit K. Bose], [[Subir Bhattacharya]] ('''2008'''). ''[https://link.springer.com/article/10.1007/s10479-007-0265-2 A two pass heuristic algorithm for scheduling ‘Blocked Out’ units in continuous processing industry]''. [https://en.wikipedia.org/wiki/Annals_of_Operations_Research Annals of Operations Research], Vol. 159, No. 1 <ref>[https://en.wikipedia.org/wiki/Deterministic_global_optimization#Mixed-integer_non-linear_programming_problems_(MINLP) Mixed-integer non-linear programming problems (MINLP) - Wikipedia]</ref>
* [https://dblp.uni-trier.de/pers/hd/b/Bose:Sumit_Kumar Sumit K. Bose], [[Subir Bhattacharya]] ('''2009'''). ''[https://www.semanticscholar.org/paper/A-State-Task-Network-model-for-scheduling-in-units-Bose-Bhattacharya/72cac81a69297c9e7545ece660c48de6842cf5c6 A State Task Network model for scheduling operations in cascaded continuous processing units]''. [https://www.journals.elsevier.com/computers-and-chemical-engineering Computers and Chemical Engineering], Vol. 33, No. 1
==2010 ...==
* [[Mathematician#RiKumar|Ritesh Kumar]], [[Subir Bhattacharya]] ('''2012'''). ''[https://ieeexplore.ieee.org/document/6211438 Cooperative Search Using Agents for Cardinality Constrained Portfolio Selection Problem]''. [[IEEE#SMC|IEEE Transactions on Systems, Man, and Cybernetics]], Part C: Applications and Reviews, Vol. 42, No. 6
=External Links=
* [https://www.iimcal.ac.in/users/subir Prof. Subir Bhattacharya, Faculty Informations]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Bhattacharya]]
