default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmbuj Mahanti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j8]Partha Saha, Indranil Bose, Ambuj Mahanti:
A knowledge based scheme for risk assessment in loan processing by banks. Decis. Support Syst. 84: 78-88 (2016)- 2014
- [c37]Amitava Ghosh, Ambuj Mahanti:
An information system for investment advisory process. ISDOC 2014: 143-148 - [c36]Amitava Ghosh, Sourya Joyee De, Ambuj Mahanti:
A Mobile Banking Model in the Cloud for Financial Inclusion in India. SIGDOC 2014: 3:1-3:9 - 2013
- [j7]Arunabha Mukhopadhyay, Samir Chatterjee, Debashis Saha
, Ambuj Mahanti, Samir K. Sadhukhan:
Cyber-risk decision models: To insure IT or not? Decis. Support Syst. 56: 11-26 (2013) - [c35]Koel Ghorai, Sourav Saha, Aishwarya Bakshi, Ambuj Mahanti, Pradeep Ray:
An mHealth Recommender for Smoking Cessation Using Case Based Reasoning. HICSS 2013: 2695-2704 - [c34]Partha Saha, N. Parameswaran, Binay Bhushan Chakraborty, Ambuj Mahanti:
A Formal Analysis of Fraud in Banking Sector. HICSS 2013: 3468-3477 - 2012
- [c33]Sourav Saha, Ambuj Mahanti:
Cloud based HIMS - An Indian Perspective. CLOSER 2012: 438-442 - 2011
- [c32]Partha Saha, Nandan Parameswaran, Pradeep Ray, Ambuj Mahanti:
Ontology Based Modeling for Information Security Management. DASC 2011: 73-80 - 2010
- [c31]Sanjog Ray, Ambuj Mahanti:
Improving Prediction Accuracy in Trust-Aware Recommender Systems. HICSS 2010: 1-9 - [c30]Sourav Saha, Sandipan Majumder, Sanjog Ray, Ambuj Mahanti:
Categorizing User Interests in Recommender Systems. KES (2) 2010: 282-291
2000 – 2009
- 2009
- [c29]Sanjog Ray, Ambuj Mahanti:
Filler Item Strategies for Shilling Attacks against Recommender Systems. HICSS 2009: 1-10 - 2008
- [c28]Sinnakkrishnan Perumal, Ambuj Mahanti:
Formal Foundation of Workflow Hyperpaths and a Graph Search Algorithm for Workflow Hyperpath Generation. HICSS 2008: 102 - [c27]Sanjog Ray, Ambuj Mahanti:
Strategies for Effective Shilling Attacks against Recommender Systems. PinKDD 2008: 111-125 - 2007
- [c26]Arunabha Mukhopadhyay, Samir Chatterjee, Debashis Saha, Ambuj Mahanti, Samir K. Sadhukhan:
Tiered Approach for Mitigating Big Security Losses: A Variance Reduction Model. AMCIS 2007: 260 - [c25]Sethuraman Janardhanan, Ambuj Mahanti, Debashis Saha, Samir K. Sadhukhan:
BDFS: A Real-Time Search Algorithm for Central Office (CO) Optimization. HICSS 2007: 48 - [c24]Sinnakkrishnan Perumal, Ambuj Mahanti:
Applying Graph Search Techniques for Workflow Verification. HICSS 2007: 48 - [c23]Arunabha Mukhopadhyay, Binay Bhushan, Debashis Saha, Ambuj Mahanti:
E-Risk Management through Self Insurance: An Option Model. HICSS 2007: 158 - [c22]Arunabha Mukhopadhyay, Samir Chatterjee, Rahul Roy, Debashis Saha, Ambuj Mahanti, Samir K. Sadhukhan:
Insuring Big Losses Due to Security Breaches through Insurance: A Business Model. HICSS 2007: 158 - 2006
- [c21]Rajanish Dass, Ambuj Mahanti:
An Efficient Heuristic Search for Real-Time Frequent Pattern Mining. HICSS 2006 - [c20]Rajanish Dass, Ambuj Mahanti:
An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics. HICSS 2006 - [c19]Sethuraman Janardhanan, Ambuj Mahanti, Debashis Saha, Samir K. Sadhukhan:
A Routing and Wavelength Assignment (RWA) Technique to Minimize the Number of SONET ADMs in WDM Rings. HICSS 2006 - [c18]Arunabha Mukhopadhyay, Samir Chatterjee, Debashis Saha, Ambuj Mahanti, Samir K. Sadhukhan:
e-Risk Management with Insurance: A Framework Using Copula Aided Bayesian Belief Networks. HICSS 2006 - 2005
- [c17]Sethuraman Janardhanan, Ambuj Mahanti, Debashis Saha:
A heuristic search based optimal wavelength assignment algorithm to minimize the number of sonet ADMS in WDM rings. Communications and Computer Networks 2005: 152-157 - [c16]Rajanish Dass, Ambuj Mahanti:
Fast Frequent Pattern Mining in Real-Time. COMAD 2005: 156-167 - [c15]Rajanish Dass, Ambuj Mahanti:
h1-max: A Domain Independent Heuristic for Real-Time Frequent Pattern Mining. COMAD (b) 2005 - [c14]Sinnakkrishnan Perumal, Ambuj Mahanti:
A Graph-Search Based Algorithm for Verifying Workflow Graphs. DEXA Workshops 2005: 992-996 - [c13]Swarup Mandal, Debashis Saha, Ambuj Mahanti:
A technique to support dynamic pricing strategy for differentiated cellular mobile services. GLOBECOM 2005: 5 - [c12]Rajanish Dass, Ambuj Mahanti:
An Efficient Technique for Frequent Pattern Mining in Real-Time Business Applications. HICSS 2005 - [c11]Rajanish Dass, Ambuj Mahanti:
An Efficient Real-Time Frequent Pattern Mining Technique Using Diff-Sets. International Conference on Computational Science (3) 2005: 818-821 - [c10]Sethuraman Janardhanan, Ambuj Mahanti, Debashis Saha, Samir K. Sadhukhan:
A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings. ICCCN 2005: 597- - [c9]Rajanish Dass, Ambuj Mahanti:
Implementing BDFS(b) with Diff-Sets for Real-Time Frequent Pattern Mining in Dense Datasets - First Findings. UDM 2005: 113-120 - 2004
- [j6]Swarup Mandal, Debashis Saha, Ambuj Mahanti:
A real-time heuristic search technique for fixed channel allocation (FCA) in mobile cellular communications. Microprocess. Microsystems 28(8): 411-416 (2004) - [c8]Merlin Nandy, Ambuj Mahanti:
An Improved Search Technique for Optimal Winner Determination in Combinatorial Auctions. HICSS 2004 - [c7]Swarup Mandal, Debashis Saha, Ambuj Mahanti:
Heuristic search techniques for cell to switch assignment in location area planning for cellular networks. ICC 2004: 4307-4311 - 2003
- [c6]Merlin Nandy, Ambuj Mahanti:
An Efficient Search Technique Using A Lower Bound Heuristic For Maximal Revenue Determination in Combinatorial Auctions. IICAI 2003: 914-927 - [c5]Swarup Mandal, Debashis Saha, Ambuj Mahanti:
A Real-time Search Technique for Fixed Channel Allocation in Cellular Mobile Communications. IICAI 2003: 966-979 - [c4]Swarup Mandal, Debashis Saha, Sougata Bera, Shubhadip Ray, Ambuj Mahanti:
An Efficient Technique for Dynamic Lightpath Establishment in Survivable Local/Metro WDM Optical Networks. IWDC 2003: 350-360 - [i1]Ambuj Mahanti, Supriyo Ghose, Samir K. Sadhukhan:
A Framework for Searching AND/OR Graphs with Cycles. CoRR cs.AI/0305001 (2003)
1990 – 1999
- 1997
- [j5]Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal:
On the Asymptotic Performance of IDA*. Ann. Math. Artif. Intell. 20(1-4): 161-193 (1997) - 1996
- [j4]Subrata Ghosh, Ambuj Mahanti, Rakesh Nagi, Dana S. Nau:
Manufacturing cell formation by state-space search. Ann. Oper. Res. 65(1): 35-54 (1996) - 1995
- [j3]Matthew P. Evett, James A. Hendler, Ambuj Mahanti, Dana S. Nau:
PRA*: Massively Parallel Heuristic Search. J. Parallel Distributed Comput. 25(2): 133-143 (1995) - 1994
- [c3]Subrata Ghosh, Ambuj Mahanti, Dana S. Nau:
ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm. AAAI 1994: 1353-1358 - 1993
- [j2]Ambuj Mahanti, Charles J. Daniels:
A SIMD Approach to Parallel Heuristic Search. Artif. Intell. 60(2): 243-282 (1993) - 1992
- [c2]Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal:
Performance of IDA on Trees and Graphs. AAAI 1992: 539-544 - [c1]Ambuj Mahanti, Charles J. Daniels:
IDPS: A Massively Parallel Heuristic Search Algorithm. IPPS 1992: 220-223 - 1991
- [j1]Subrata Ghosh, Ambuj Mahanti:
Bidirectional Heuristic Search with Limited Resources. Inf. Process. Lett. 40(6): 335-340 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
