Image:Row-convex-path.svg
From Wikipedia, the free encyclopedia
Row-convex-path.svg (SVG file, nominally 207 × 180 pixels, file size: 6 KB)
| This is a file from the Wikimedia Commons. The description on its description page there is shown below.
|
[edit] Summary
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
[edit] Licensing
 |
I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide. In case this is not legally possible: Afrikaans | Alemannisch | Aragonés | العربية | Asturianu | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Eʋegbe | Ελληνικά | English | Español | Esperanto | Euskara | Estremeñu | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Kurdî / كوردی | Latina | Lietuvių | Latviešu | Magyar | Македонски | Bahasa Melayu | Nederlands | Norsk (bokmål) | Norsk (nynorsk) | 日本語 | Polski | Português | Ripoarisch | Română | Русский | Shqip | Slovenčina | Slovenščina | Српски / Srpski | Svenska | ไทย | Tagalog | Türkçe | Українська | Tiếng Việt | Walon | 中文(简体) | 中文(繁體) | zh-yue-hant | +/- |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | 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 ) |
