Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Chakrabarti, P.P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Incremental Beam search
S.G. Vadlamudi
,
Sandip Aine
,
P.P. Chakrabarti
Information Processing Letters
113
(22-24), 2013, pp. 888-893
Partition oriented frame based fair scheduler
Arnab Sarkar
,
P.P. Chakrabarti
,
Sujoy Ghose
Journal Parallel Distributed Computing
70
(7), 2010, pp. 707-718
The power of first-order quantification over states in branching and linear time temporal logics
Krishnendu Chatterjee
,
Pallab Dasgupta
,
P.P. Chakrabarti
Information Processing Letters
91
(5), 2004, pp. 201-210
Quantified computation tree logic
A.C. Patthak
,
I. Bhattacharya
,
A. Dasgupta
,
Pallab Dasgupta
,
P.P. Chakrabarti
Information Processing Letters
82
, 2002, pp. 123-129
Agent search in uniform
b
-ary trees: Multiple goals and unequal costs
Pallab Dasgupta
,
P.P. Chakrabarti
,
S.C. DeSarkar
Information Processing Letters
58
(6), 1996, pp. 311-318
Multiobjective heuristic search in AND/OR graphs
Pallab Dasgupta
,
P.P. Chakrabarti
,
S.C. DeSarkar
Journal of Algorithms
20
(2), 1996, pp. 282-311
A new competitive algorithm for agent searching in unknown streets
Pallab Dasgupta
,
P.P. Chakrabarti
,
S.C. DeSarkar
Lecture Notes in Computer Science
1180
, 1996, pp. 147-155
Utility of pathmax in partial order heuristic search
Pallab Dasgupta
,
P.P. Chakrabarti
,
S.C. DeSarkar
Information Processing Letters
55
, 1995, pp. 317-322
A near optimal algorithm for the extended cow-path problem in the presence of relative errors
Pallub Dasgupta
,
P.P. Chakrabarti
,
S.C. DeSarkar
Lecture Notes in Computer Science
1026
, 1995, pp. 22-36
Improving greedy algorithms by lookahead-search
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. DeSarkar
Journal of Algorithms
16
(1), 1994, pp. 1-23
A general best first search algorithm in AND/OR graphs
P.P. Chakrabarti
,
S. Ghose
Journal of Algorithms
13
, 1992, pp. 177-187
Effective use of memory in iterative deepening search
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. De Sarkar
Information Processing Letters
42
, 1992, pp. 47-52
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. De Sarkar
Information Processing Letters
42
, 1992, pp. 173-177
Multiple stack branch and bound
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. de Sarkar
Information Processing Letters
37
, 1991, pp. 43-48
Increasing search efficiency using multiple heuristics
P.P. Chakrabarti
,
S. Ghose
,
A. Pandey
,
S.C. de Sarkar
Information Processing Letters
30
, 1989, pp. 33-36