File:Row-convex-path.svg
Size of the above preview of this SVG file: 250 × 217 pixels. Other resolutions: 330 × 287 pixels | 960 × 835 pixels | 1,280 × 1,113 pixels | 3,840 × 3,339 pixels.
Original file (SVG file, nominally 207 × 180 pixels, file size: 6 KB)
This is a file from the Wikimedia Commons. Information from its description page there is shown below.
Commons is a freely licensed media file repository. You can help.
Commons is a freely licensed media file repository. You can help.
Summary
| Description | How row convex-ness and path consistency ensure satisfiability for binary constraint networks. Each matrix represents the constraint between xi and xk+1. An evaluation a1..ak restrict to a row in each matrix. The composition of these rows is a row-convex matrix. Strong path consistency ensures the existence of a consistent value ak+1 for xk+1 |
| Date | 14 February 2006 (original upload date) |
| Source | No machine-readable source provided. Own work assumed (based on copyright claims). |
| Author | No machine-readable author provided. Tizio assumed (based on copyright claims). |
Licensing
|
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 17:01, 14 February 2006 | | 207 × 180 (6 KB) | Tizio | White background |
| 16:46, 14 February 2006 |  | 207 × 171 (6 KB) | Tizio | How row convex-ness and path consistency ensure satisfiability for binary constraint networks. Each matrix represents the constraint between xi and xk+1. An evaluation a1..ak restrict to a row in each matrix. The composition of these rows is a row-convex |
File usage
The following page uses this file:
