Scheduling Aircraft Using Constraint Satisfaction
β Scribed by Pim van Leeuwen; Henk Hesselink; Jos Rohling
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 259 KB
- Volume
- 76
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton-Raphson method. It is fast, but has the instability problem: the method requires good initial values. To overcome this problem,
We address the problem of solving a constraint satisfaction problem (CSP) by treating a constraint logic program (CLP) as a network of constraints. We attempt to show that each computation in a CLP becomes a sequence of linear steps, since the check satisfiability of the system of constraints is app
The problem of image segmentation using constraint satisfaction neural networks (CSNN) has been considered. Several variations of the CSNN theme have been advanced to improve its performance or to explore new structures. These new segmentation algorithms are based on interplay of additional constrai