We stand with Ukraine  

Vipin Kumar

Affiliations:
  • University of Maryland College Park, Laboratory for Pattern Analysis, Computer Science Departmen, MD, USA


According to our database1, Vipin Kumar authored at least 6 papers between 1981 and 1984.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1984
Parallel Branch-and-Bound Formulations for AND/OR Tree Search.
[BibTeX]
[DOI]
Vipin Kumar
,
Laveen N. Kanal
IEEE Trans. Pattern Anal. Mach. Intell., 1984

General Branch and Bound, and its Relation to A and AO.
[BibTeX]
[DOI]
Dana S. Nau
,
Vipin Kumar
,
Laveen N. Kanal
Artif. Intell., 1984

1983
A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures.
[BibTeX]
[DOI]
Vipin Kumar
,
Laveen N. Kanal
Artif. Intell., 1983

The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures.
[BibTeX]
[DOI]
Vipin Kumar
,
Laveen N. Kanal
Proceedings of the National Conference on Artificial Intelligence, 1983

1982
A General Paradigm for A.I. Search Procedures.
[BibTeX]
[DOI]
Dana S. Nau
,
Vipin Kumar
,
Laveen N. Kanal
Proceedings of the National Conference on Artificial Intelligence, 1982

1981
Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results.
[BibTeX]
[DOI]
Laveen N. Kanal
,
Vipin Kumar
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981


  Loading...