SATHIA MOORTHY SUBBARAYAN                           

  

PhD Student                                                                                

E-mail : sathi@itu.dk

IT- University of Copenhagen                                                      

Phone : (+45)-50133027

Rued Langgaards 7,  DK-2300  Copenhagen S, Denmark       

Fax : (+45)-72185001

 

 

 

 

WORK EXPERIENCE

PhD ScholarshipIT- University of Copenhagen, Denmark       February 2005-present

 

Developer (part-time), Ange Optimization, Denmark                 March 2006-April 2007   

 

Internship, Microsoft Research, Cambridge, UK            October 2005- December 2005    

 

Research Programmer, Department of Innovation,

                IT- University of Copenhagen, Denmark              February 2004-January 2005

 

Research Assistant and PhD Scholarship, Department of Computer Science,

                                    University of Bristol – UK                    April 2003 – January 2004

 

Programmer,  Cognizant Technology Solutions,      

                        Chennai, India                                         September 2002 – March 2003

 

 

 

 

AREAS OF INTEREST

Constraint Satisfaction, Configuration, SAT Solving, Optimization, Knowledge Compilation

 

 

 

 

EDUCATION

PhD Student, IT- University of Copenhagen,                           February 2005 - present

 

Masters in IT, IT- University of Copenhagen,                          February 2004 – April 2007

 

Bachelor of Engineering, Computer Science and Engineering, Thiagarajar College of Engg., Madurai Kamaraj University, Cumulative average: 79 / 100.

FIRST CLASS WITH DISTINCTION                                                     August 1998- May 2002

 

 

 

 

PUBLICATIONS

  · S. Subbarayan, "Efficient Reasoning for Nogoods in Constraint Solvers with BDDs", Springer LNCS Proceedings of the PADL symposium, Jan-2008, San Francisco, USA

 

  · S. Subbarayan, "An Empirical Comparison of CSP Decomposition Methods", Proceedings of the Doctoral Program, CP conference, Sept-2007, Providence, USA. 

 

  · S. Subbarayan, L. Bordeaux and Y Hamadi, "Knowledge Compilation Properties of Tree-of-BDDs", Proceedings of the AAAI conference, July-2007, Vancouver, Canada

 

  · S. Subbarayan, and , H R Andersen, "Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs", Proceedings of the IJCAI conference, Jan-2007, Hyderabad, India

 

  · S. Subbarayan, L. Bordeaux and Y Hamadi, "On Hybrid SAT Solving using Tree Decompositions and BDDs", Technical Report MSR-TR-2006-28, Microsoft Research, Cambridge, UK (2006)

 

  · S. Subbarayan, and H R Andersen, "Linear Functions for Interactive Configuration Using Join Matching and CSP Tree Decomposition", Proceedings of the IJCAI-2005 Configuration Workshop, July- 2005, Edinburgh, UK

 

  · S. Subbarayan, and H R Andersen, " Integrating a Variable Ordering Heuristic with BDDs and CSP Decomposition Techniques for Interactive Configurators", Research Note, April- 2005

 

  · S. Subbarayan, "Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems", Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CP-AI-OR, (LNCS 3524) May-2005, Prague, Czech Republic

 

· S. Subbarayan, R M Jensen, T. Hadzic, H R Andersen, J Mψller, and H Hulgaard, "Comparing Two Implementations of a Complete and Backtrack-Free Interactive Configurator", Proceedings of the CP-04 Workshop on CSP Techniques with Immediate Application, 97-111, Sept-2004, Toronto, Canada

 

· T. Hadzic, S. Subbarayan, R M Jensen, H R Andersen, J Mψller, and H Hulgaard, "Fast Backtrack-Free Product Configuration Using a Precompiled Solution Space Representation", Proceedings of International Conference on Economic, Technical and Organisational aspects of Product Configuration Systems, June-2004 , Copenhagen

 

· S Subbarayan and DK Pradhan, “NiVER: Non Increasing Variable Elimination Resolution”, In Selected Revised Papers of  International Conference on Theory and Applications of Satisfiability Testing Conference, SAT-2004, (Springer LNCS), May-2004, Vancouver, Canada

 

· G. Andal Jayalakshmi, S. Sathiamoorthy, and R. Rajaram –“A Hybrid Genetic Algorithm- A New Approach to solve Traveling Salesman Problem”, International Journal of Computational Engineering Science Vol.2 No.2, pp339–355, Imperial College Press. June 2001 Available at:

http://www.worldscinet.com/journals/ijces/02/0202/S1465876301000350.html

 

· Co-author of the DIMACS Technical Report on “TSP Heuristics” , Preliminary draft available at www.research.att.com/~dsj/chtsp/

 

· S. Sathiamoorthy –“LaySeq: A New Representation for Non-Slicing Floorplans”, Proceedings of 6th IEEE VLSI Design and Test Workshop, pp 317-327, Bangalore, India, August 29-31, 2002.

 

· S. Sathiamoorthy, and G. Andal Jayalakshmi – “Hybrid Genetic Algorithm for VLSI Macro Cell Layout”, in 6th On-line World Conference on Soft Computing in Industrial Applications, September 10-24, 2001. Published as a chapter in book titled “Soft Computing in Industry –Recent Applications”, Springer-Verlag. pp 797-804. One among WSC6 Best Papers.

 

· S. Sathiamoorthy, and G. Andal Jayalakshmi –“An Adaptive Hybrid Genetic algorithm for Macro Cell Layout”, Proceedings of International Symposium on Artificial Intelligence 2001.December 18-20, 2001

 

· S. Sathiamoorthy, G. Andal Jayalakshmi, and R. Rajaram –“Traveling Salesman Problem – A new approach using a Hybrid Genetic Agorithm”, Proceedings of National Conference on Advanced Computing 2001, pp 135-142. February 2-3, 2001

 

 

 

 

UNDERGRADUATE

PRESENTATIONS

“A new evolutionary algorithm for TSP”                                                 Second Prize

-SOFTWIZ 2001 (National Level Paper Presentation Contest)

Computer Society of India, Feb 21-25, 2001

 

“New Genetic Local Search Operators for TSP”                                        First Prize

-FACE 2000 (National Level Technical Symposium)

Shanmuga College of Engineering, SASTRA University, India, Sep 29-30, 2000  

 

“Genetic VLSI Layouts”                                                                         Second Prize

-CYBERX 2001 (Inter Departmental Technical Symposium)

 CSE-MCA Association, Thiagarajar College of Engg., India, Mar 22, 2001         

 

 

 

 

B.E. PROJECT

Sequential circuit ATPG using Genetic Algorithms.  (VLSI Testing)

 

 

 

 

SPONSORED PROJECT

 Title        : Design of an Optimal VLSI Macro Cell Layout.

 Sponsor : Tamilnadu  State Council for Science and Technology(2001- 2002)

 

 

 

 

AUTHORED

ToB : A C++ Library for Tree-of-BDDs Compilation             (April 2007)

SOFTWARES/ TOOLS

TreeD : A C++ Library for Tree/Hypertree Decomposition    (April 2007)

 

CLib : Configuration Benchmarks Library    (July 2004)

 

NiVER and LiVER – Non-increasing VER (Variable Elimination Resolution) and Limited increasing VER, efficient resolution based CNF formula simplifiers.

Available at: www.itu.dk/people/sathi/niver.html   (January 2004)

 

VLSI PLACER – A VLSI-CAD tool for optimizing ‘VLSI Macro Cell Layout’ using a Genetic Algorithm. Developed in C++.  (June 2001)

 

TSP SOLVER- Traveling Salesman Problem solver using a new greedy heuristic technique. Developed in C, with an user friendly GUI. Has an image manipulation tool for creating background maps. (October 1999)

 

WINTWEAKS– A windows system-performance optimization and customization tool. Developed in VC++ using MFC. (September 2000)

 

 

 

 

SOFTWARE PRESENTATION

AWARDS

“WinTweaks 1.0”                                                             Best Software Award

-CYBERRAAGA 2000 (National Level Technical Symposium)

PSNA College of Engg. & Tech, India                                                         September 20-21, 2001 

 

“WinTweaks 1.5”                                                             Best Software Award

- INFOGENX 2000 (National Level Technical Symposium)

Shanmuga College of Engineering, India                                                     September 29-30, 2001