Sujoy Ghose

Available identifiers

Publication	Date of Publication	Type
Measuring robustness of superpeer topologies	2014-03-13	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/Q4414612	2003-07-25	Paper
Complexity of fragmentable object bin packing and an application	2002-08-06	Paper
Some new results in the complexity of allocation and binding in data path synthesis	2002-08-06	Paper
Learning for efficient search	2002-02-18	Paper
A probabilistic estimator for the vertex deletion problem	1998-08-20	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
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
Generalized best first search using single and multiple heuristics	1992-06-28	Paper
Multiple stack branch and bound	1991-01-01	Paper
Admissibility of \(AO^ *\) when heuristics overestimate	1988-01-01	Paper
Heuristic search through islands	1986-01-01	Paper

This page was built for person: Sujoy Ghose