Abstract | ||
---|---|---|
Interval narrowing techniques are a key issue for handling constraints overreal numbers in the logic programming framework. However, the standardfixed-point algorithm used for interval narrowing may give rise to cyclicphenomena and hence to problems of slow convergence. Analysis of thesecyclic phenomena shows: 1) that a large number of operations carried outduring a cycle are unnecessary; 2) that many others could be removed fromcycles and performed only once when these cycles have been... |
Year | Venue | Field |
---|---|---|
1996 | JICSLP | Algorithm,Boosting (machine learning),Artificial intelligence,Machine learning,Mathematics |
DocType | Citations | PageRank |
Conference | 9 | 0.91 |
References | Authors | |
11 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Olivier Lhomme | 1 | 386 | 28.48 |
Arnaud Gotlieb | 2 | 833 | 63.83 |
Michel Rueher | 3 | 613 | 59.81 |
Patrick Taillibert | 4 | 77 | 15.76 |