Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Subir Bhattacharya

dblp:79/980 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Planning, search and constraint satisfaction · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game tree search
0.031995
Experimenting with Revisits in Game Tree Search · IJCAI 1995
Searching Game Trees in Parallel Using SSS · IJCAI 1989
Making Best Use of Available Memory When Searching Game Trees · AAAI 1986
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search › search-based problem solving
parallel search
0.011989
Searching Game Trees in Parallel Using SSS · IJCAI 1989
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search
memory-bounded search
0.011986
Making Best Use of Available Memory When Searching Game Trees · AAAI 1986

Methods — techniques the papers use, named apart from their topics

game tree search · 0.0parallel search · 0.0SSS* · 0.0
YearPublicationVenuePosition
2012 Cooperative Search Using Agents for Cardinality Constrained Portfolio Selection Problem
abstract
This paper presents an agent-based model to select an investment portfolio with a restriction on the number of stocks in it. Daily movements of all the stocks in the market for the past few years are assumed to be available. The scheme deploys a federally structured consortium of agents in the stock market at the start of the historical period. Each agent starts with a pseudorandom portfolio and follows individual investment strategies as it walks through the past data. The agents are designed to emulate some of the characteristics of human investors-adjusting the weights of the stocks based on its own attitude toward risk, occasionally dropping and adding stocks to the portfolio, etc. Periodically, the agents share information about their performances and can switch portfolios. A final cardinality constrained portfolio is constructed by consolidating individual portfolios arrived at by the agents working on the historical data of the stocks. When tested in real markets of the U.K. and Japan, the model suggested portfolios that were quite competitive to, and frequently better than, the portfolios suggested by the mean-variance models.
Subir Bhattacharya
IEEE Trans. Syst. Man Cybern. Part C2
1995 Experimenting with Revisits in Game Tree Search
Subir Bhattacharya
IJCAI1
1994 A General Framework for Minimax Search in Game Trees
Subir Bhattacharya, Amitava Bagchi
Inf. Process. Lett.1
1993 A Faster Alternative to SSS* with Extension to Variable Memory
Subir Bhattacharya, Amitava Bagchi
Inf. Process. Lett.1
1989 Searching Game Trees in Parallel Using SSS
Subir Bhattacharya, Amitava Bagchi
IJCAI1
1986 Making Best Use of Available Memory When Searching Game Trees
Subir Bhattacharya, Amitava Bagchi
AAAI1