|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 4 van 11 gevonden artikelen
| Titel: |
Constraint updating |
| Auteur: |
Jacobi, Walter Hower Stephan |
| Verschenen in: |
Journal of experimental & theoretical artificial intelligence |
| Paginering: | Jaargang 10 (1998) nr. 1 pagina's 25-36 |
| Jaar: |
1998-01-01 |
| Inhoud: |
. In the areas of artificial intelligence and computer-aided design there are many fundamental problems that can be formulated and solved by constraint techniques. The problems are often of a dynamic nature in the sense that the original problem changes in the course of time; furthermore, the granularity of the changes is often located on a tuple level. So, working on that level ensures maximal flexibility and problem adequacy. Here, both the modifications and the recomputations of the affected constraints are working on that level. With the NP-complete complexity of global constraint satisfaction in mind, it is desirable to decrease the average complexity of the consistency algorithm. This objective may be achieved by applying the changes incrementally to only the affected parts of the network avoiding total recomputations wherever possible. Especially in applications with large domains and many solution tuples, the reduction of the computational complexity is enormous. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 4 van 11 gevonden artikelen
| << vorige | volgende >> |