Partha Pratim Chakrabarti

Available identifiers

zbMath Open chakrabarti.partha-pratimMaRDI QIDQ334151

List of research outcomes

Publication	Date of Publication	Type
Searching game trees under a partial order	2022-09-22	Paper
Anytime pack search	2019-07-10	Paper
A near optimal algorithm for the extended cow-path problem in the presence of relative errors	2017-01-19	Paper
Formal assessment of reliability specifications in embedded cyber-physical systems	2016-10-31	Paper
Incremental beam search	2014-04-14	Paper
HEURISTIC SEARCH UNDER CONTRACT	2012-03-30	Paper
Partition oriented frame based fair scheduler	2012-03-07	Paper
A corrigendum to: ``Sticky-ERfair: a task-processor affinity aware proportional fair scheduler	2012-01-26	Paper
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler	2012-01-26	Paper
https://portal.mardi4nfdi.de/entity/Q2999212	2011-05-11	Paper
Can Semi-Formal be Made More Formal?	2010-06-02	Paper
The power of first-order quantification over states in branching and linear time temporal logics	2009-07-21	Paper
Distributed Computing - IWDC 2004	2005-08-12	Paper
A branching time temporal framework for quantitative reasoning	2003-06-09	Paper
Min-max event-triggered computation tree logic	2003-05-01	Paper
A correction to: ``Agent searching in a tree and the optimality of iterative deepening	2003-02-04	Paper
Some new results in the complexity of allocation and binding in data path synthesis	2002-08-06	Paper
Complexity of fragmentable object bin packing and an application	2002-08-06	Paper
Heuristic search strategies for multiobjective state space search	2002-02-18	Paper
Learning for efficient search	2002-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4933704	2000-01-11	Paper
A probabilistic estimator for the vertex deletion problem	1998-08-20	Paper
Agent search in uniform b-ary trees: Multiple goals and unequal costs	1997-02-27	Paper
Utility of pathmax in partial order heuristic search	1997-02-27	Paper
Multiobjective Heuristic Search in AND/OR Graphs	1996-12-11	Paper
Agent searching in a tree and the optimality of iterative deepening	1995-01-09	Paper
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search	1994-05-03	Paper
Improving Greedy Algorithms by Lookahead-Search	1994-04-28	Paper
Effective use of memory in iterative deepening search	1993-01-16	Paper
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem	1993-01-16	Paper
Generalized best first search using single and multiple heuristics	1992-06-28	Paper
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds	1992-06-28	Paper
A general best first search algorithm in AND/OR graphs	1992-06-28	Paper
The t-cost-m-neighbour distance in digital geometry	1991-01-01	Paper
Multiple stack branch and bound	1991-01-01	Paper
Admissibility of \(AO^ *\) when heuristics overestimate	1988-01-01	Paper
Distance functions in digital geometry	1987-01-01	Paper
Generalized distances in digital geometry	1987-01-01	Paper
Heuristic search through islands	1986-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Partha Pratim Chakrabarti