Difference between revisions of "Subir Bhattacharya"
GerdIsenberg (talk | contribs) (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...") |
GerdIsenberg (talk | contribs) |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
'''Subir Bhattacharya''',<br/> | '''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]. | + | 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]. He holds a Ph.D. from [https://en.wikipedia.org/wiki/University_of_Calcutta University of Calcutta] in 1990 under [[Amitava Bagchi]], and researched on [[Search|search algorithms]]. They investigated [[George Stockman|Stockman's]] [[SSS* and Dual*|SSS*]], and proposed a [[Recursion|recursive]] implementation, called [[SSS* and Dual*#RecSSS|RecSSS*]]. |
| − | |||
| − | |||
=Selected Publications= | =Selected Publications= | ||
| − | <ref>[https://dblp.uni-trier.de/pers/hd/b/Bhattacharya:Subir dblp: Subir Bhattacharya]</ref> <ref>[ | + | <ref>[https://dblp.uni-trier.de/pers/hd/b/Bhattacharya:Subir dblp: Subir Bhattacharya]</ref> <ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> |
==1986 ...== | ==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]] ('''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]] | ||
| Line 29: | Line 27: | ||
=External Links= | =External Links= | ||
* [https://www.iimcal.ac.in/users/subir Prof. Subir Bhattacharya, Faculty Informations] | * [https://www.iimcal.ac.in/users/subir Prof. Subir Bhattacharya, Faculty Informations] | ||
| + | * [https://genealogy.math.ndsu.nodak.edu/id.php?id=81236 Subir Bhatta - The Mathematics Genealogy Project] | ||
=References= | =References= | ||
<references /> | <references /> | ||
'''[[People|Up one level]]''' | '''[[People|Up one level]]''' | ||
| + | [[Category:Mathematician|Bhattacharya]] | ||
[[Category:Researcher|Bhattacharya]] | [[Category:Researcher|Bhattacharya]] | ||
Latest revision as of 17:58, 16 November 2020
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
