The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

T. K. Satish Kumar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. T. K. Satish Kumar
    A Polynomial-Time Algorithm for Simple Temporal Problems with Piecewise Constant Domain Preference Functions. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:67-72 [Conf]
  2. T. K. Satish Kumar
    Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. T. K. Satish Kumar
    Tractable Classes of Metric Temporal Problems with Domain Rules. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  4. T. K. Satish Kumar
    On the Tractability of Restricted Disjunctive Temporal Problems. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:110-119 [Conf]
  5. T. K. Satish Kumar
    Incremental Computation of Resource-Envelopes in Producer-Consumer Models. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:664-678 [Conf]
  6. T. K. Satish Kumar
    On the Tractability of Smooth Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2005, pp:304-319 [Conf]
  7. T. K. Satish Kumar
    Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1954-1959 [Conf]
  8. T. K. Satish Kumar
    A Compositional Approach to Causality. [Citation Graph (0, 0)][DBLP]
    SARA, 2000, pp:309-312 [Conf]
  9. T. K. Satish Kumar
    Synergy between Compositional Modeling and Bayesian Networks. [Citation Graph (0, 0)][DBLP]
    SARA, 2000, pp:324-325 [Conf]
  10. T. K. Satish Kumar
    An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection. [Citation Graph (0, 0)][DBLP]
    SARA, 2002, pp:126-139 [Conf]
  11. T. K. Satish Kumar
    Reformulating Combinatorial Optimization as Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    SARA, 2002, pp:336-337 [Conf]
  12. T. K. Satish Kumar, Richard Dearden
    The Oracular Constraints Method. [Citation Graph (0, 0)][DBLP]
    SARA, 2002, pp:290-298 [Conf]
  13. T. K. Satish Kumar, Stuart Russell
    On Some Tractable Cases of Logical Filtering. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:83-92 [Conf]

  14. CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem. [Citation Graph (, )][DBLP]


  15. A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  16. On Disjunctive Representations of Distributions and Randomization. [Citation Graph (, )][DBLP]


Search in 0.180secs, Finished in 0.181secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002