942 search results - page 123 / 189 » Distance Constraint Satisfaction Problems |
133
click to vote
CP
2000
Springer
15 years 7 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...
IJSN
2006
15 years 3 months ago
2006
: WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is achallenging...
139
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
137
Voted
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
130
Voted
CCIA
2005
Springer
15 years 9 months ago
2005
Springer
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...