Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Vipin Kumar 0006

dblp:k/VipinKumar-6 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 1984
0000-0003-2511-2546ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
6 papers
Planning, search and constraint satisfaction · 87% Segmentation and scene understanding · 13%
Theoretical computer science
4 papers
Mathematical optimization · 66% Algorithms and data structures · 34%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › tree search
AND/OR tree search		 0.021984
Parallel Branch-and-Bound Formulations for AND/OR Tree Search · IEEE Trans. Pattern Anal. Mach. Intell. 1984
A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures · Artif. Intell. 1983
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
heuristic search		 0.021984
General Branch and Bound, and its Relation to A and AO · Artif. Intell. 1984
The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures · AAAI 1983
Mathematical optimization › integer programming
branch-and-bound		 0.021984
General Branch and Bound, and its Relation to A and AO · Artif. Intell. 1984
The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures · AAAI 1983
Parallel and multicore computing › parallel algorithms
parallel search		 0.021984
Parallel Branch-and-Bound Formulations for AND/OR Tree Search · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results · IJCAI 1981
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search
branch-and-bound search		 0.021983
A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures · Artif. Intell. 1983
Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results · IJCAI 1981
Computer vision › Segmentation and scene understanding › medical image segmentation
semi-supervised segmentation		 0.011984
Parallel Branch-and-Bound Formulations for AND/OR Tree Search · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Parallel and multicore computing › parallel algorithms › parallel search
parallel branch-and-bound		 0.011984
Parallel Branch-and-Bound Formulations for AND/OR Tree Search · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Mathematical optimization
discrete optimization		 0.011983
The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures · AAAI 1983
Algorithms and data structures
dynamic programming		 0.011983
The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures · AAAI 1983
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game tree search		 0.011981
Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results · IJCAI 1981
Algorithms and data structures › search algorithms
game tree search		 0.011984
Parallel Branch-and-Bound Formulations for AND/OR Tree Search · IEEE Trans. Pattern Anal. Mach. Intell. 1984
Algorithms and data structures
search algorithms		 0.011982
A General Paradigm for A.I. Search Procedures · AAAI 1982

Methods — techniques the papers use, named apart from their topics

parallel branch-and-bound · 0.0composite decision process · 0.0search procedure formalization · 0.0parallel branch and bound · 0.0
YearPublicationVenuePosition
1984 General Branch and Bound, and its Relation to A and AO
Dana S. Nau, Vipin Kumar 0006, Laveen N. Kanal
 Artif. Intell.2
1984 Parallel Branch-and-Bound Formulations for AND/OR Tree Search
abstract
This paper discusses two general schemes for performing branch-and-bound (B&B) search in parallel. These schemes are applicable in principle to most of the problems which can be solved by B&B. The schemes are implemented for SSS*, a versatile algorithm having applications in game tree search, structural pattern analysis, and AND/OR graph search. The performance of parallel SSS* is studied in the context of AND/OR tree and game tree search. The paper concludes with comments on potential applications of these parallel implementations of SSS* in structural pattern analysis and game playing.
Vipin Kumar 0006, Laveen N. Kanal
 IEEE Trans. Pattern Anal. Mach. Intell.1
1983 The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures
Vipin Kumar 0006, Laveen N. Kanal
 AAAI1
1983 A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures
Vipin Kumar 0006, Laveen N. Kanal
 Artif. Intell.1
1982 A General Paradigm for A.I. Search Procedures
Dana S. Nau, Vipin Kumar 0006, Laveen N. Kanal
 AAAI2
1981 Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results
Laveen N. Kanal, Vipin Kumar 0006
 IJCAI2