default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVipin Kumar 0006
Person information
- affiliation: University of Maryland College Park, Laboratory for Pattern Analysis, Computer Science Departmen, MD, USA
Other persons with the same name
- Vipin Kumar — disambiguation page
- Vipin Kumar 0001
![[0000-0002-9040-2665]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-9040-2665")
— University of Minnesota, Department of Computer Science and Engineering, USA - Vipin Kumar 0002 — Jawaharlal Nehru University, School of Computer and Systems Sciences, New Delhi, India
- Vipin Kumar 0003 — Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany (and 1 more)
- Vipin Kumar 0004 — Lovely Professional University, Department of Computer Science Engineering, India
- Vipin Kumar 0005 — Bharat Electronics Limited, Product Development & Innovation Center, Bangalore, India
- Vipin Kumar 0007 — National Institute of Technology Sikkim, Department of Electronics and Communication Engineering, Ravangla, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1984
[j3]Dana S. Nau, Vipin Kumar, Laveen N. Kanal:
General Branch and Bound, and its Relation to A and AO. Artif. Intell. 23(1): 29-58 (1984)- [j2]Vipin Kumar, Laveen N. Kanal:
Parallel Branch-and-Bound Formulations for AND/OR Tree Search. IEEE Trans. Pattern Anal. Mach. Intell. 6(6): 768-778 (1984) - 1983
- [j1]Vipin Kumar, Laveen N. Kanal:
A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures. Artif. Intell. 21(1-2): 179-198 (1983) - [c3]Vipin Kumar, Laveen N. Kanal:
The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures. AAAI 1983: 220-224 - 1982
- [c2]Dana S. Nau, Vipin Kumar, Laveen N. Kanal:
A General Paradigm for A.I. Search Procedures. AAAI 1982: 120-123 - 1981
- [c1]Laveen N. Kanal, Vipin Kumar:
Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results. IJCAI 1981: 569-571
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-12-23 20:35 CET 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:
