569 search results - page 11 / 114 » An Empirical Study of Structural Constraint Solving Techniqu... |
CP
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
WEBI
2007
Springer
14 years 25 days ago
2007
Springer
Nonnegative Matrix Factorization (NMF) has been proven to be effective in text mining. However, since NMF is a well-known unsupervised components analysis technique, the existing ...
AAAI
2007
13 years 9 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
BMCBI
2006
13 years 6 months ago
2006
Background: Microarray studies provide a way of linking variations of phenotypes with their genetic causations. Constructing predictive models using high dimensional microarray me...
ASIAMS
2007
IEEE
14 years 1 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...