Sciweavers

741 search results - page 17 / 149
» Robust Constraint Solving Using Multiple Heuristics
Sort
View
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
14 years 2 months ago
Solving Consensus and Semi-supervised Clustering Problems Using Nonnegative Matrix Factorization
Consensus clustering and semi-supervised clustering are important extensions of the standard clustering paradigm. Consensus clustering (also known as aggregation of clustering) ca...
Tao Li, Chris H. Q. Ding, Michael I. Jordan
AMAI
2004
Springer
14 years 2 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
CP
2001
Springer
14 years 1 months ago
GAC on Conjunctions of Constraints
Abstract. Applying GAC on conjunctions of constraints can lead to more powerful pruning [1]. We show that there exists a simple heuristic for deciding which constraints might be us...
George Katsirelos, Fahiem Bacchus
IRI
2008
IEEE
14 years 3 months ago
Robust integration of multiple information sources by view completion
There are many applications where multiple data sources, each with its own features, are integrated in order to perform an inference task in an optimal way. Researchers have shown...
Shankara B. Subramanya, Baoxin Li, Huan Liu
CEC
2011
IEEE
12 years 8 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow