16504 search results - page 21 / 3301 » New Problems, New Solutions |
170
click to vote
AAAI
1994
15 years 5 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
131
Voted
WIDM
2004
ACM
15 years 10 months ago
2004
ACM
The use of relational database management systems (RDBMSs) to store and query XML data has attracted considerable interest with a view to leveraging their powerful and reliable da...
116
Voted
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...
104
click to vote
AAAI
2008
15 years 6 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
120
Voted
IWANN
2001
Springer
15 years 9 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...