A. Bagchi

17 papers A* 3B 1C 1Journal 10Unranked 2
YearRankTypeTitle / Venue / Authors
1997 J jnl
RID3: An ID3-Like Algorithm for Real Data.
Inf. Sci.
Nikhil R. Pal, Sukumar Chakraborty, A. Bagchi
1994 C conf
A Comparison of Algorithms for Least Absolute Value State Estimation in Electoric Power Networks.
ISCAS
A. Bagchi, K. A. Clements, P. W. Davis, F. H. Maurais
1994 J jnl
A graph-coloring scheme for scheduling cell transmissions and its photonic implementation.
IEEE Trans. Commun.
T. V. Lakshman, A. Bagchi, K. Rastani
1993 J jnl
Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems.
Oper. Res.
K. V. Viswanathan, A. Bagchi
1992 — conf
A Fast Parallel Scheduler for Resource Requests Implemented Using Optical Devices.
IPPS
T. V. Lakshman, A. Bagchi, K. Rastani
1992 B conf
Learning Object Models in Visual Semantic Networks.
ICTAI
A. Gupta, A. Bagchi
1992 J jnl
On Sorting in the Presence of Erroneous Information.
Inf. Process. Lett.
A. Bagchi
1990 J jnl
Book reviews.
ZOR Methods Model. Oper. Res.
D. Ivanchev, A. Bagchi
1988 A* conf
An Exact Best-First Search Procedure for the Constrained Rectangular Guillotine Knapsack Problem.
AAAI
K. V. Viswanathan, A. Bagchi
1985 J jnl
Weighted Heuristic Search in Networks.
J. Algorithms
A. Bagchi, Pradip K. Srimani
1984 — conf
On the Mean Weight Balance Factor of Binary Trees.
FSTTCS
Asim K. Pal, A. Bagchi
1982 J jnl
Aspects of insertion in random trees.
Computing
A. Bagchi, Edward M. Reingold
1979 J jnl
On V-Optimal Trees.
SIAM J. Comput.
A. Bagchi, J. K. Roy
1976 J jnl
Neighborhood Search Algorithms for Guaranteeing Optimal Traveling Salesman Tours Must Be Inefficient.
J. Comput. Syst. Sci.
Sam L. Savage, Peter Weiner, A. Bagchi
1975 J jnl
Symposium on stochastic control.
Autom.
A. Bagchi
1973 A* conf
Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient
STOC
Peter Weiner, Sam L. Savage, A. Bagchi
1972 A* conf
Program Size and Economy of Descriptions: Preliminary Report
STOC
Albert R. Meyer, A. Bagchi