Sujoy Ghose

According to our database1, Sujoy Ghose authored at least 56 papers between 1986 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
ERfair Scheduler with Processor Suspension for Real-Time Multiprocessor Embedded Systems.
ACM Trans. Design Autom. Electr. Syst., 2016

2011
A Corrigendum to: "Sticky-ERfair: a task-processor affinity aware proportional fair scheduler".
Real-Time Systems, 2011

Sticky-ERfair: a task-processor affinity aware proportional fair scheduler.
Real-Time Systems, 2011

A Low-Overhead Partition-Oriented ERfair Scheduler for Hard Real-Time Embedded Systems.
Embedded Systems Letters, 2011

2010
Partition oriented frame based fair scheduler.
J. Parallel Distrib. Comput., 2010

Safe-ERfair.
Proceedings of the VLSI Design 2010: 23rd International Conference on VLSI Design, 2010

Brief announcement: superpeer formation amidst churn and rewiring.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

How do Superpeer Networks Emerge?
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Formal Understanding of the Emergence of Superpeer Networks: A Complex Network Approach.
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

2009
A personalized information retrieval module for retrieving learning materials.
Proceedings of the 2009 International Workshop on Technology for Education, 2009

ERfair Scheduler with Processor Shutdown.
Proceedings of the 16th International Conference on High Performance Computing, 2009

2008
Automatic Extraction of Pedagogic Metadata from Learning Content.
I. J. Artificial Intelligence in Education, 2008

2007
Two New Algorithms for Static Virtual Topology Design in Optical WDM Networks.
I. J. Wireless & Optical Communications, 2007

Measuring robustness of superpeer topologies.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

How stable are large superpeer networks against attack?
Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007

Effect of Dynamicity on Peer to Peer Networks.
Proceedings of the High Performance Computing, 2007

Analyzing the vulnerability of superpeer networks against attack.
Proceedings of the 2007 ACM Conference on Computer and Communications Security, 2007

2006
Design benchmarking, user behavior analysis and link-structure personalization in commercial web sites.
Internet Research, 2006

Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Multihop Virtual Topology Design in WDM Optical Networks for Self-Similar Traffic.
Photonic Network Communications, 2005

Automatic Annotation of Documents with Metadata for use with Tutoring System.
Proceedings of the 2nd Indian International Conference on Artificial Intelligence, 2005

2004
An algorithm for optimal assignment of a wavelength in a tree topology and its application in WDM networks.
IEEE Journal on Selected Areas in Communications, 2004

New Schemes for Connection Establishment in GMPLS Environment for WDM Networks.
I. J. Wireless & Optical Communications, 2004

2003
A stochastic model of e-customer behavior.
Electronic Commerce Research and Applications, 2003

A rerouting technique with minimum traffic disruption for dynamic traffic in WDM networks.
Proceedings of the 11th IEEE International Conference on Networks, 2003

2002
Solving Constraint Optimization Problems from CLP-Style Specifications Using Heuristic Search Techniques.
IEEE Trans. Knowl. Data Eng., 2002

Online Customized Index Synthesis in Commercial Web Sites.
IEEE Intelligent Systems, 2002

New Scheme for Design of Static Virtual Topology in Wide Area Optical Networks.
Proceedings of the Distributed Computing, 2002

2000
GABIND: a GA approach to allocation and binding for the high-level synthesis of data paths.
IEEE Trans. VLSI Syst., 2000

1999
A design space exploration scheme for data-path synthesis.
IEEE Trans. VLSI Syst., 1999

1998
Complexity of Scheduling in High Level Synthesis.
VLSI Design, 1998

Learning while solving problems in best first search.
IEEE Trans. Systems, Man, and Cybernetics, Part A, 1998

A Framework for Learning in Search-Based Systems.
IEEE Trans. Knowl. Data Eng., 1998

1997
Design Space Exploration for Data Path Synthesis.
Proceedings of the 10th International Conference on VLSI Design (VLSI Design 1997), 1997

1996
Growing nonuniform feedforward networks for continuous mappings.
Neurocomputing, 1996

Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach.
Proceedings of the 9th International Conference on VLSI Design (VLSI Design 1996), 1996

1994
A connectionist approach for clustering with applications in image analysis.
IEEE Trans. Systems, Man, and Cybernetics, 1994

Improving Greedy Algorithms by Lookahead-Search.
J. Algorithms, 1994

1993
Point matching using asymmetric neural networks.
Pattern Recognition, 1993

Combining State Assignment with PLA Folding.
Proceedings of the Sixth International Conference on VLSI Design, 1993

1992
A connectionist approach for peak detection in Hough space.
Pattern Recognition, 1992

A General Best First Search Algorithm in AND/OR Graphs.
J. Algorithms, 1992

Generalized best first search using single and multiple heuristics.
Inf. Sci., 1992

A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem.
Inf. Process. Lett., 1992

Effective Use of Memory in Iterative Deepening Search.
Inf. Process. Lett., 1992

A New algorithm for combined PLA folding.
Proceedings of the Fifth International Conference on VLSI Design, 1992

Interconnect Optimization Techniques in Data Path Synthesis.
Proceedings of the Fifth International Conference on VLSI Design, 1992

1991
Multiple Stack Branch and Bound.
Inf. Process. Lett., 1991

Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds.
Artif. Intell., 1991

1989
Increasing Search Efficiency Using Multiple Heuristics.
Inf. Process. Lett., 1989

Increasing Search Efficiency Using Multiple Heuristics.
Inf. Process. Lett., 1989

Heuristic Search in Restricted Memory.
Artif. Intell., 1989

Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms.
Proceedings of the Knowledge Based Computer Systems, 1989

1988
Best first search in and/or graphs.
Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1987
Admissibility of A0* when Heuristics Overestimate.
Artif. Intell., 1987

1986
Heuristic Search Through Islands.
Artif. Intell., 1986


  Loading...