Sciweavers

1589 search results - page 140 / 318
» Constraints with Variables' Annotations
Sort
View
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
14 years 3 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
AI
2003
Springer
14 years 2 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
AAAI
2008
13 years 11 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
CP
2008
Springer
13 years 10 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
JAIR
2011
123views more  JAIR 2011»
13 years 3 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...