S. C. De Sarkar

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Natural resources data management system (NRDMS): a suite of web-accessible geo-spatial data processing tools for e-Governance in India.
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.
Computational intelligence, Vieweg, ISBN: 978-3-528-05708-4, 1999

1996
Multiobjektive Heuristic Search in AND/OR Graphs.
J. Algorithms, 1996

Agent Search in Uniform b-Ary Trees: Multiple Goals and Unequal Costs.
Inf. Process. Lett., 1996

Searching Game Trees under a Partial Order.
Artif. Intell., 1996

A New Competitive Algorithm for Agent Searching in Unknown Streets.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995
Utility of Pathmax in Partial Order Heuristic Search.
Inf. Process. Lett., 1995

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

A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative Errors.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

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

Agent Searching in a Tree and the Optimality of Iterative Deepening.
Artif. Intell., 1994

Multiobjective Search in VLSI Design.
Proceedings of the Seventh International Conference on VLSI Design, 1994

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

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

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

1989
A Theorem Prover for Verifying Iterative Programs Over Integers.
IEEE Trans. Software Eng., 1989

A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers.
IEEE Trans. Software Eng., 1989

Some Inference Rules for Integer Arithmetic for Verification of Flowchart Programs on Integers.
IEEE Trans. Software Eng., 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

1974
Unate Cascade Realization of Synchronous Sequential Machines.
IEEE Trans. Computers, 1974

1971
On the Determination of Irredundant Prime Closed Sets.
IEEE Trans. Computers, 1971

1970
Authors' Reply.
IEEE Trans. Computers, 1970

1969
Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets.
IEEE Trans. Computers, 1969


  Loading...