808 search results - page 97 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
CP
2000
Springer
15 years 2 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
ROBOTICA
2002
2002
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
14 years 9 months ago
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
SCP
1998
14 years 9 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...
CP
1995
Springer
15 years 1 months ago
1995
Springer
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...