S. C. De Sarkar

According to our database, S. C. De Sarkar authored at least 30 papers between 1969 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Natural resources data management system (NRDMS): a suite of web-accessible geo-spatial data processing tools for e-Governance in India.

P. S. Acharya, Soumya K. Ghosh, S. C. De Sarkar

Proceedings of the 2nd International Conference and Exhibition on Computing for Geospatial Research & Application, 2011

1999

Multiobjective heuristic search - an introduction to intelligent search methods for multicriteria optimization.

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

Computational intelligence, Vieweg, ISBN: 978-3-528-05708-4, 1999

1996

Multiobjektive Heuristic Search in AND/OR Graphs.

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

J. Algorithms, 1996

Agent Search in Uniform b-Ary Trees: Multiple Goals and Unequal Costs.

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

Inf. Process. Lett., 1996

Searching Game Trees under a Partial Order.

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

Artif. Intell., 1996

A New Competitive Algorithm for Agent Searching in Unknown Streets.

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995

Utility of Pathmax in Partial Order Heuristic Search.

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

Inf. Process. Lett., 1995

A Correction to "Agent Searching in a Tree and the Optimality of Iterative Deepening".

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

Artif. Intell., 1995

A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors.

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1994

Improving Greedy Algorithms by Lookahead-Search.

U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

J. Algorithms, 1994

Agent Searching in a Tree and the Optimality of Iterative Deepening.

Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar

Artif. Intell., 1994

Multiobjective Search in VLSI Design.

Pallab Dasgupta, Prasenjit Mitra, P. P. Chakrabarti, S. C. De Sarkar

Proceedings of the Seventh International Conference on VLSI Design, 1994

1992

Generalized best first search using single and multiple heuristics.

P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Inf. Sci., 1992

A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem.

U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Inf. Process. Lett., 1992

Effective Use of Memory in Iterative Deepening Search.

U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Inf. Process. Lett., 1992

1991

Multiple Stack Branch and Bound.

U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Inf. Process. Lett., 1991

Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds.

U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Artif. Intell., 1991

1989

A Theorem Prover for Verifying Iterative Programs Over Integers.

Dipankar Sarkar, S. C. De Sarkar

IEEE Trans. Software Eng., 1989

A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers.

Dipankar Sarkar, S. C. De Sarkar

IEEE Trans. Software Eng., 1989

Some Inference Rules for Integer Arithmetic for Verification of Flowchart Programs on Integers.

Dipankar Sarkar, S. C. De Sarkar

IEEE Trans. Software Eng., 1989

Increasing Search Efficiency Using Multiple Heuristics.

P. P. Chakrabarti, Sujoy Ghose, A. Pandey, S. C. De Sarkar

Inf. Process. Lett., 1989

Heuristic Search in Restricted Memory.

P. P. Chakrabarti, Sujoy Ghose, Arup Acharya, S. C. De Sarkar

Artif. Intell., 1989

Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms.

U. K. Sarkar, P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Proceedings of the Knowledge Based Computer Systems, 1989

1988

Best first search in and/or graphs.

P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1987

Admissibility of A0* when Heuristics Overestimate.

P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Artif. Intell., 1987

1986

Heuristic Search Through Islands.

P. P. Chakrabarti, Sujoy Ghose, S. C. De Sarkar

Artif. Intell., 1986

1974

Unate Cascade Realization of Synchronous Sequential Machines.

S. C. De Sarkar, Subir Bandyopadhyay, Arun K. Choudhury

IEEE Trans. Computers, 1974

1971

On the Determination of Irredundant Prime Closed Sets.

S. C. De Sarkar, A. K. Basu, Arun K. Choudhury

IEEE Trans. Computers, 1971

1970

Authors' Reply.

Arun Kumar Choudhury, A. K. Basu, S. C. De Sarkar

IEEE Trans. Computers, 1970

1969

Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets.

S. C. De Sarkar, A. K. Basu, Arun Kumar Choudhury

IEEE Trans. Computers, 1969