The SCEAS System
| |||||||

## Search the dblp DataBase
T. K. Satish Kumar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - T. K. Satish Kumar
**Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints.**[Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf] - T. K. Satish Kumar
**Tractable Classes of Metric Temporal Problems with Domain Rules.**[Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf] - T. K. Satish Kumar
**On the Tractability of Restricted Disjunctive Temporal Problems.**[Citation Graph (0, 0)][DBLP] ICAPS, 2005, pp:110-119 [Conf] - T. K. Satish Kumar
**Incremental Computation of Resource-Envelopes in Producer-Consumer Models.**[Citation Graph (0, 0)][DBLP] CP, 2003, pp:664-678 [Conf] - T. K. Satish Kumar
**On the Tractability of Smooth Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] CPAIOR, 2005, pp:304-319 [Conf] - 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] - T. K. Satish Kumar
**A Compositional Approach to Causality.**[Citation Graph (0, 0)][DBLP] SARA, 2000, pp:309-312 [Conf] - T. K. Satish Kumar
**Synergy between Compositional Modeling and Bayesian Networks.**[Citation Graph (0, 0)][DBLP] SARA, 2000, pp:324-325 [Conf] - 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] - T. K. Satish Kumar
**Reformulating Combinatorial Optimization as Constraint Satisfaction.**[Citation Graph (0, 0)][DBLP] SARA, 2002, pp:336-337 [Conf] - T. K. Satish Kumar, Richard Dearden
**The Oracular Constraints Method.**[Citation Graph (0, 0)][DBLP] SARA, 2002, pp:290-298 [Conf] - T. K. Satish Kumar, Stuart Russell
**On Some Tractable Cases of Logical Filtering.**[Citation Graph (0, 0)][DBLP] ICAPS, 2006, pp:83-92 [Conf] **CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem.**[Citation Graph (, )][DBLP]**A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems.**[Citation Graph (, )][DBLP]**On Disjunctive Representations of Distributions and Randomization.**[Citation Graph (, )][DBLP]
Search in 0.180secs, Finished in 0.181secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |