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