405 search results - page 50 / 81 » On the Complexity of Global Constraint Satisfaction |
CCIA
2005
Springer
15 years 4 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...
AIPS
1994
15 years 12 days ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
JCP
2006
14 years 11 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
CSFW
2004
IEEE
15 years 2 months ago
2004
IEEE
Workflow management systems (WFMSs) have attracted a lot of interest both in academia and the business community. A workflow consists of a collection of tasks that are organized t...
SIGMOD
1996
ACM
15 years 3 months ago
1996
ACM
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...