Sciweavers

670 search results - page 27 / 134
» Intractability and clustering with constraints
Sort
View
AMAI
1999
Springer
14 years 9 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
AIPS
2008
15 years 1 days ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams
AI
2007
Springer
14 years 9 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
PKDD
2000
Springer
107views Data Mining» more  PKDD 2000»
15 years 1 months ago
Expert Constrained Clustering: A Symbolic Approach
Abstract. A new constrained model is discussed as a way of incorporating efficiently a priori expert knowledge into a clustering problem of a given individual set. The first innova...
Fabrice Rossi, Frédérick Vautrain
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
15 years 4 months ago
Semi-supervised Clustering Using Bayesian Regularization
Text clustering is most commonly treated as a fully automated task without user supervision. However, we can improve clustering performance using supervision in the form of pairwi...
Zuobing Xu, Ram Akella, Mike Ching, Renjie Tang