18 search results - page 1 / 4 » Tensor decomposition and approximation schemes for constrain... |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
CSR
2007
Springer
14 years 1 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
SIAMMAX
2011
12 years 10 months ago
2011
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
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...