K. G. Ramakrishnan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2002

The structure and management of service level agreements in networksEric Bouillet, Debasis Mitra, K. G. Ramakrishnan. jsac, 20(4):691-699, 2002. [doi]

Asymptotic Solution to an Inverse Problem for a Shared Unbuffered ResourceJohn A. Morrison, K. G. Ramakrishnan. siamam, 63(1):222-240, 2002. [doi]

2001

2000

Optimal Design of Signaling Networks for Internet TelephonyAravind Srinivasan, K. G. Ramakrishnan, Krishnan Kumaran, Murali Aravamudan, Shamim A. Naqvi. infocom 2000: 707-716 [doi]

1999

Optimization and Design of Network Routing Using Refined Asymptotic ApproximationsDebasis Mitra, John A. Morrison, K. G. Ramakrishnan. pe, 36-37(1-4):267-288, 1999.

Virtual Private Networks: Joint Resource Allocation and Routing DesignDebasis Mitra, John A. Morrison, K. G. Ramakrishnan. infocom 1999: 480-490

1998

1997

An overview of the multimedia communications exchange (MMCX) and its performance characterizationAnwar Elwalid, Glen G. Freundlich, Paul M. Gerhardt, Hassan Hagirahim, K. G. Ramakrishnan, David Tse. bell, 2(2):15-35, 1997. [doi]

Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment ProblemPanos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende, Yong Li. siamjo, 7(1):280-294, 1997. [doi]

1996

On-line routing for permanent virtual circuitsRainer Gawlick, Charles R. Kalmanek, K. G. Ramakrishnan. comcom, 19(3):235-244, 1996. [doi]

ATM network design and optimization: a multirate loss network frameworkDebasis Mitra, John A. Morrison, K. G. Ramakrishnan. ton, 4(4):531-543, 1996. [doi]

ATM Network Design and Optimization: A Multirate Loss Network FrameworkDebasis Mitra, John A. Morrison, K. G. Ramakrishnan. infocom 1996: 994-1003

1995

On-Line Routing for Permanent Virtural CircuitsRainer Gawlick, Charles R. Kalmanek, K. G. Ramakrishnan. infocom 1995: 278-288

The allocation of value for jointly provided servicesPeter Linhart, Roy Radner, K. G. Ramakrishnan, Richard Steinberg. telsys, 4(1):151-175, 1995. [doi]

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear ProgrammingMauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner. ior, 43(5):781-791, 1995. [doi]

1994

Lower bounds for the quadratic assignment problemYong Li, Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende. anor, 50(1):387-410, 1994. [doi]

1993

On the expected optimal value of random assignment problems: Experimental results and open questionsPanos M. Pardalos, K. G. Ramakrishnan. coap, 2(3):261-271, 1993. [doi]

1992

A continuous approach to inductive inferenceAnil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende. mp, 57:215-238, 1992.

1991

1990

Computational Experience with an Interior Point Algorithm on the Satisfiability ProblemAnil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende. ipco 1990: 333-349

1980

Solving Two-Commodity Transportation Problems with Coupling ConstraintsK. G. Ramakrishnan. JACM, 27(4):736-757, 1980. [doi]

1976

A numerically stable optimization method based on A homogeneous functionJ. S. Kowalik, K. G. Ramakrishnan. mp, 11(1):50-66, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL