|
Search the dblp DataBase
Sujoy Ghose:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Admissibility of A0* when Heuristics Overestimate. [Citation Graph (1, 0)][DBLP] Artif. Intell., 1987, v:34, n:1, pp:97-113 [Journal]
- P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Best first search in and/or graphs. [Citation Graph (0, 0)][DBLP] ACM Conference on Computer Science, 1988, pp:256-261 [Conf]
- Devshri Roy, Sudeshna Sarkar, Sujoy Ghose
Automatic Annotation of Documents with Metadata for use with Tutoring System. [Citation Graph (0, 0)][DBLP] IICAI, 2005, pp:3576-3592 [Conf]
- Raja Datta, Sujoy Ghose, Indranil Sengupta
New Scheme for Design of Static Virtual Topology in Wide Area Optical Networks. [Citation Graph (0, 0)][DBLP] IWDC, 2002, pp:280-289 [Conf]
- U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms. [Citation Graph (0, 0)][DBLP] KBCS, 1989, pp:451-461 [Conf]
- Chittaranjan A. Mandal, P. P. Chakrabarti, Sujoy Ghose
Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach. [Citation Graph (0, 0)][DBLP] VLSI Design, 1996, pp:122-125 [Conf]
- Chittaranjan A. Mandal, P. P. Chakrabarti, Sujoy Ghose
Design Space Exploration for Data Path Synthesis. [Citation Graph (0, 0)][DBLP] VLSI Design, 1997, pp:166-173 [Conf]
- Chunduri Rama Mohan, Partha Pratim Chakrabarti, Sujoy Ghose
Combining State Assignment with PLA Folding. [Citation Graph (0, 0)][DBLP] VLSI Design, 1993, pp:9-14 [Conf]
- Bivas Mitra, Md. Moin Afaque, Sujoy Ghose, Niloy Ganguly
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP] ICDCN, 2006, pp:257-268 [Conf]
- P. P. Chakrabarti, Sujoy Ghose, Arup Acharya, S. C. De Sarkar
Heuristic Search in Restricted Memory. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1989, v:41, n:2, pp:197-221 [Journal]
- P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Heuristic Search Through Islands. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1986, v:29, n:3, pp:339-347 [Journal]
- U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1991, v:50, n:2, pp:207-221 [Journal]
- Mamata Jenamani, Pratap K. J. Mohapatra, Sujoy Ghose
A stochastic model of e-customer behavior. [Citation Graph (0, 0)][DBLP] Electronic Commerce Research and Applications, 2003, v:2, n:1, pp:81-94 [Journal]
- Mamata Jenamani, Pratap K. J. Mohapatra, Sujoy Ghose
Online Customized Index Synthesis in Commercial Web Sites. [Citation Graph (0, 0)][DBLP] IEEE Intelligent Systems, 2002, v:17, n:6, pp:20-26 [Journal]
- V. V. Vinod, Sujoy Ghose
Growing nonuniform feedforward networks for continuous mappings. [Citation Graph (0, 0)][DBLP] Neurocomputing, 1996, v:10, n:1, pp:55-69 [Journal]
- P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar
Increasing Search Efficiency Using Multiple Heuristics. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:30, n:1, pp:33-36 [Journal]
- P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar
Increasing Search Efficiency Using Multiple Heuristics. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:32, n:5, pp:275-275 [Journal]
- U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Multiple Stack Branch and Bound. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:37, n:1, pp:43-48 [Journal]
- U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Effective Use of Memory in Iterative Deepening Search. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:42, n:1, pp:47-52 [Journal]
- U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:42, n:3, pp:173-177 [Journal]
- P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Generalized best first search using single and multiple heuristics. [Citation Graph (0, 0)][DBLP] Inf. Sci., 1992, v:60, n:1-2, pp:145-175 [Journal]
- P. P. Chakrabarti, Sujoy Ghose
A General Best First Search Algorithm in AND/OR Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1992, v:13, n:2, pp:177-187 [Journal]
- U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar
Improving Greedy Algorithms by Lookahead-Search. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1994, v:16, n:1, pp:1-23 [Journal]
- V. V. Vinod, Santanu Chaudhury, Sujoy Ghose, J. Mukherjee
A connectionist approach for peak detection in Hough space. [Citation Graph (0, 0)][DBLP] Pattern Recognition, 1992, v:25, n:10, pp:1253-1264 [Journal]
- V. V. Vinod, Sujoy Ghose
Point matching using asymmetric neural networks. [Citation Graph (0, 0)][DBLP] Pattern Recognition, 1993, v:26, n:8, pp:1207-1214 [Journal]
- Pallab Dasgupta, P. P. Chakrabarti, Arnab Dey, Sujoy Ghose, Wolfgang Bibel
Solving Constraint Optimization Problems from CLP-Style Specifications Using Heuristic Search Techniques. [Citation Graph (0, 0)][DBLP] IEEE Trans. Knowl. Data Eng., 2002, v:14, n:2, pp:353-368 [Journal]
- Sudeshna Sarkar, P. P. Chakrabarti, Sujoy Ghose
A Framework for Learning in Search-Based Systems. [Citation Graph (0, 13)][DBLP] IEEE Trans. Knowl. Data Eng., 1998, v:10, n:4, pp:563-575 [Journal]
- Sudeshna Sarkar, P. P. Chakrabarti, Sujoy Ghose
Learning while solving problems in best first search. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Systems, Man, and Cybernetics, Part A, 1998, v:28, n:4, pp:535-541 [Journal]
- V. V. Vinod, Santanu Chaudhury, J. Mukherjee, Sujoy Ghose
A connectionist approach for clustering with applications in image analysis. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Systems, Man, and Cybernetics, 1994, v:24, n:3, pp:365-384 [Journal]
- Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy Ganguly
Measuring robustness of superpeer topologies. [Citation Graph (0, 0)][DBLP] PODC, 2007, pp:372-373 [Conf]
- Chittaranjan A. Mandal, P. P. Chakrabarti, Sujoy Ghose
A design space exploration scheme for data-path synthesis. [Citation Graph (0, 0)][DBLP] IEEE Trans. VLSI Syst., 1999, v:7, n:3, pp:331-338 [Journal]
- Chittaranjan A. Mandal, P. P. Chakrabarti, Sujoy Ghose
GABIND: a GA approach to allocation and binding for the high-level synthesis of data paths. [Citation Graph (0, 0)][DBLP] IEEE Trans. VLSI Syst., 2000, v:8, n:6, pp:747-750 [Journal]
Analyzing the vulnerability of superpeer networks against attack. [Citation Graph (, )][DBLP]
ERfair Scheduler with Processor Shutdown. [Citation Graph (, )][DBLP]
Effect of Dynamicity on Peer to Peer Networks. [Citation Graph (, )][DBLP]
How do Superpeer Networks Emerge? [Citation Graph (, )][DBLP]
How stable are large superpeer networks against attack? [Citation Graph (, )][DBLP]
Brief announcement: superpeer formation amidst churn and rewiring. [Citation Graph (, )][DBLP]
Safe-ERfair. [Citation Graph (, )][DBLP]
Formal Understanding of the Emergence of Superpeer Networks: A Complex Network Approach. [Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.023secs
|