Institution
Indian Institute of Management Calcutta
Education•Kolkata, India•
About: Indian Institute of Management Calcutta is a education organization based out in Kolkata, India. It is known for research contribution in the topics: Supply chain & Emerging markets. The organization has 415 authors who have published 1354 publications receiving 21725 citations. The organization is also known as: IIMC & IIM Calcutta.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This work addresses the problem of designing an optimum LA within available spectrum such that total network cost, comprising of LU cost and cost for paging, can be minimized by resolving the inherent trade-off between these two cost components.
Abstract: In a mobile wireless cellular network the size of a location area (LA) could vary from one single cell to the entire service area under a Mobile Switching Center These two situations depict two extreme possibilities For the first case paging cost would be minimal whereas location update (LU) cost will be significantly high For the latter possibility, the situation will just be the reverse This work addresses the problem of designing an optimum LA within available spectrum such that total network cost, comprising of LU cost and cost for paging, can be minimized by resolving the inherent trade-off between these two cost components We have formulated a constrained cost optimization problem to find out the optimal LA size Since the optimization problem is combinatorial in nature, as solution methodologies we have presented two heuristics, based on Simulated Annealing and Genetic Algorithm The quality of the solutions obtained proves that in near future these two evolutionary methods will be strong cont
3 citations
••
01 Apr 1997TL;DR: New tighter sufficiency conditions for slicibility of rectangular graphs are postulated and utilized in the generation of slicible area-optimal floorplans, which help in reducing the total effort for unified topology generation and sizing.
Abstract: The graph dualization approach to fIoorplan design with rectangular modules usually involves topology generation followed by sizing. The sizing problem for nonslicible topologies is NP-complete. Slicible topologies are often preferred for their simplicity and efficiency. Linear time algorithms exist for generation of topology corresponding to a given rectangular graph, but these do not guarantee slicible topologies even if one exists. Moreover, there is a class of rectaugular graphs, known as inherently nonslicible graphs, which do not have any slicible topologies. Previous methods for efficient generation of a slicible topology under sizing constraints for any rectangular graph, are likely to require addition of pseudeblocks, thereby more empty area. In this paper, new tighter sufficiency conditions for slicibility of rectangular graphs are postulated and utilized in the generation of slicible area-optimal floorplans. These graph-theoretic conditions not only capture a larger class of slicible rectangular graphs but also help in reducing the total effort for unified topology generation and sizing.
3 citations
••
TL;DR: In this article, the authors argue that stock return-based performance metrics are common in CEO compensation contracts in the United States, but similar CEO pay arrangements may not be appropriate in India given higher stock return.
Abstract: Although stock return-based performance metrics are common in CEO compensation contracts in the United States, similar CEO pay arrangements may not be appropriate in India given higher stock return...
3 citations
••
16 Aug 2016TL;DR: This research, using agent-based simulation of SSM, investigates the role of “market rules” and “advertiser practices” in generating emergent click share heterogeneity among advertisers in an industry.
Abstract: Keyword-based search engine advertising markets on the Internet, referred to as Sponsored Search Markets (SSMs), have reduced entry barriers to advertising for niche players. Known empirical research, though scant and emerging, suggests that while these markets provided niche firms with greater access, they do exhibit high levels of concentration—a phenomenon that warrants further study. This research, using agent-based simulation of SSM, investigates the role of “market rules” and “advertiser practices” in generating emergent click share heterogeneity among advertisers in an industry. SSMs often rank ads based on the click-through rate (CTR) that gives rise to reinforcing dynamics at an individual keyword level. In the presence of spillovers arising from advertisers’ practice of managing keyword bids with a cost cap operating on the keyword portfolio, these reinforcing dynamics can endogenously generate industry-level concentration. Analysis of counterfactual markets with different window sizes used to compute CTR reveals that industry-level concentration bears an inverted-“U” relationship with window size.
3 citations
••
TL;DR: A probabilistic model of average case analysis of template matching thinning algorithms is proposed and a bound on the number of iterations required is computed and also the requirement of average time to complete the process of thinning of a uniformly distributed binary image in sequential as well as a parallel environment.
3 citations
Authors
Showing all 426 results
Name | H-index | Papers | Citations |
---|---|---|---|
Russell W. Belk | 76 | 351 | 39909 |
Vishal Gupta | 47 | 387 | 9974 |
Sankaran Venkataraman | 32 | 75 | 19911 |
Subrata Mitra | 32 | 219 | 3332 |
Eiji Oki | 32 | 588 | 5995 |
Indranil Bose | 30 | 97 | 3629 |
Pradip K. Srimani | 30 | 268 | 2889 |
Rahul Mukerjee | 30 | 206 | 3507 |
Ruby Roy Dholakia | 29 | 102 | 5158 |
Per Skålén | 25 | 57 | 2763 |
Somprakash Bandyopadhyay | 23 | 111 | 1764 |
Debashis Saha | 22 | 181 | 2615 |
Haritha Saranga | 19 | 42 | 1523 |
Janat Shah | 19 | 52 | 1767 |
Rohit Varman | 18 | 46 | 1387 |