711 search results - page 110 / 143 » Amalgams of Constraint Satisfaction Problems |
141
click to vote
CP
2000
Springer
15 years 8 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...
109
click to vote
IJSN
2006
15 years 4 months ago
2006
: WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is achallenging...
148
click to vote
IJCNN
2006
IEEE
15 years 10 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...
139
click to vote
CCIA
2005
Springer
15 years 10 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...
141
click to vote
IJCAI
2003
15 years 5 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...