Google SearchIf you're having trouble accessing Google Search, please click here, or send feedback.
BDDs in OCaml (1) - Thomas's blog
Binary decision diagrams (BDDs in short) are a staple of computer science, that are used to represent Boolean functions in a compact manner. BDDs are described at length in the volume 4, fascicule 1 of Knuth's "The art of computer programming", who calls them "wonderful". In the last few months, I have been playing a lot with BDDs and related structures, and the more I play with them the more I lo
BDDs - Binary Decision Diagrams
Take a map of mainland USA, and consider the following problems: Suppose you want to visit every state capitol exactly once, traveling on highways. Which route is shortest? Which route is longest? What is the mean and standard deviation of all the routes? Weight the states by any means, for example, by reading their two-letter code as a number in base 36. Then find a set of states such that no two
Vol.27 No.5 (2012/09) 決定グラフを用ã„ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ | 人工知能å¦ä¼š (The Japanese Society for Artificial Intelligence)
ç§ã®ãƒ–ックマーク 決定グラフを用ã„ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ 科å¦æŠ€è¡“振興機構　ERATOæ¹Šé›¢æ•£æ§‹é€ å‡¦ç†ç³»ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆã€€ç ”究員 å·åŽŸ ç´” ã¯ã˜ã‚ã«BDD (Binary Decision Diagramã€äºŒåˆ†æ±ºå®šã‚°ãƒ©ãƒ•) ã¯n変数0/1è«–ç†é–¢æ•°ã‚’効率良ã表ç¾ã™ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚る。 BDDã¯80年代ã‹ã‚‰90年代後åŠã«ã‹ã‘ã¦ç››ã‚“ã«ç ”究ã•ã‚Œã¦ãŠã‚Šã€ 主ã«LSI回路è¨è¨ˆã‚„モデル検査ã®åˆ†é‡Žã«ãŠã„ã¦åºƒã使ã‚れる技術ã¨ãªã£ãŸã€‚ 2000年代以é™ã¯ã€BDDã‚„ãã®æ´¾ç”Ÿå½¢ã‚’〠データマイニングや知è˜ç™ºè¦‹ã€ç¢ºçŽ‡æŽ¨è«–ã€åˆ—挙アルゴリズムè¨è¨ˆã€ãƒã‚¤ã‚ªã‚¤ãƒ³ãƒ•ã‚©ãƒžãƒ†ã‚£ãƒƒã‚¯ã‚¹ç‰ã€ æƒ…å ±ç§‘å¦ã®æ§˜ã€…ãªåˆ†é‡Žã«é©ç”¨ã™ã‚‹å‹•ããŒåºƒãŒã£ã¦ã„る。 ã¾ãŸã€çµ„åˆã›é›†åˆï¼ˆé›†åˆæ—）を表ç¾ã™ã‚‹ ZDD（Zero-Suppressed BDD）やã€æ–‡å—列集åˆã‚’表ç¾ã™ã‚‹ SeqBDD (Sequence BDD)〠置æ›ã®é›†åˆã‚’表ç¾ã™ã‚‹ Ï€DD (PiDD, Per
OCamlã§BDDã‚’è¡Œã†ãƒ©ã‚¤ãƒ–ラリを作ã£ã¦ã¿ãŸ - deruiã®æ—¥è¨˜
社会人ã«ãªã£ã¦æ—©7å¹´ç›®ã€ã‚„ã£ã¨æ˜‡çµ¦ã¨ã„ã†äº‹è±¡ã‚’経験ã§ããã†ã§ã™ã€‚ã“ã‚“ã ã‘ã‚„ã£ã¦çµ¦æ–™ä¸ŠãŒã‚‰ã‚“ã‹ã£ãŸã‚‰è»¢è·ã—ãŸæ–¹ãŒã„ã„よã€ã¨è¨€ã‚ã‚Œã¦ã¾ã™ãŒã€ä¸‡ãŒä¸€ä¸ŠãŒã‚‰ã‚“ã‹ã£ãŸã‚‰ã¾ãŸè»¢è·æ´»å‹•ã—ãªã„ã¨ãªã‚‰ã‚“ã®ã‹ãªãƒ»ãƒ»ãƒ»ã€‚ã—ã‚“ã©ã„ãªã€‚ ã•ã¦ã€ãã‚“ãªèº«ã®å›žã‚Šã®ã“ã¨ã¯ã©ã†ã§ã‚‚ã„ã„ã®ã§ã™ãŒã€OCamlã§ã¡ã¾ã¡ã¾è‰²ã€…ãªã‚‚ã®ã‚’作ã£ãŸã‚Šã—ã¦ã„ã¾ã™ã€‚ã¡ã¾ã¡ã¾ã™ãŽã¦ä½•ã‚‚ã§ãã‚ãŒã£ã¦ãªã„ã®ãŒæ‚²ã—ã„ã§ã™ã€‚ ãã‚“ãªä¸ã§ã€ã¨ã‚Šã‚ãˆãšåˆ©ç”¨ã§ãã‚‹ã‹ãªãƒ¼ã€ã¨ã„ã†ãらã„ã¾ã§ãã¦ã€è‡ªåˆ†ã§åˆ©ç”¨ã—ãŸã‚Šã—ã¦ã¿ã¦ã„るライブラリãŒã‚ã‚Šã¾ã™ã€‚ https://github.com/derui/simplespec åå‰ã¯æ°—ã«ã—ãªã„ã§ãã ã•ã„。 作ã£ãŸå‹•æ©Ÿ ã¶ã£ã¡ã‚ƒã‘る㨠https://github.com/andrenth/ospec ã“れをã‚ã£ã¡ã‚ƒå‚考ã«ã—ã¦ã„ã¾ã™ã€‚ã¨ã„ã†ã‹åŸºæœ¬çš„ãªã‚³ãƒ¼ãƒ‰éƒ¨åˆ†ã¯ã‹ãªã‚Šã‚¯ãƒãƒ¼ãƒ³ã—ã¦ã„ã¾ã™ãŒãƒ»ãƒ»ãƒ»ã€‚ ãŸã ã—ã€å€‹äººçš„ã«ã‚¤ãƒ³ãƒ‡ãƒ³ãƒˆ
「フカシギã®æ•°ãˆæ–¹ã€ã®å•é¡Œã‚’解ã„ã¦ã¿ãŸ
先日ã€ã€Œã€Žãƒ•ã‚«ã‚·ã‚®ã®æ•°ãˆæ–¹ã€ ãŠããˆã•ã‚“ã¨ã„ã£ã—ã‚‡ï¼ ã¿ã‚“ãªã§æ•°ãˆã¦ã¿ã‚ˆã†ï¼ã€ã¨ã„ã†å‹•ç”»ã‚’見ãŸã€‚æ ¼å状ã®ãƒžã‚¹ã®å·¦ä¸Šã‹ã‚‰å³ä¸‹ã¾ã§ã®çµŒè·¯ãŒä½•é€šã‚Šã‚ã‚‹ã®ã‹ã‚’調ã¹ã¦ã€æ ¼åãŒå¤šããªã‚Œã°ãªã‚‹ã»ã©çµ„ã¿åˆã‚ã›ã®æ•°ãŒçˆ†ç™ºçš„ã«å¢—ãˆã‚‹ã“ã¨ã‚’æ•™ãˆã¦ãれる動画ã 。ã“ã‚Œã¯è‡ªå·±å›žé¿æ©è¡Œ(Self-avoiding walk)ã¨å‘¼ã°ã‚Œã¦ã„ã‚‹å•é¡Œã‚‰ã—ã„。 ã“ã‚Œã ã‘èžã„ã¦ã‚‚ãã‚Œã»ã©ã‚¤ãƒ³ãƒ‘クトã¯ãªã„ã®ã ãŒã€å‹•ç”»ã«å‡ºã¦ãã‚‹ãŠããˆã•ã‚“ã®çµŒè·¯ã‚’調ã¹ã‚ã’る執念ãŒã‚‚ã®å‡„ãã€ãƒãƒƒãƒˆä¸Šã§ã‚‚çµæ§‹ãªè©±é¡Œã«ãªã£ã¦ã„る。執念ã¨è¨€ã†ã‚ˆã‚Šã‚‚ç‹‚æ°—ã«è¿‘ã„。ã—ã‹ã—ã€è©±é¡Œã«ãªã£ãŸå‰²ã«ã¯å‹•ç”»å†…ã§è¨€åŠã•ã‚Œã¦ã„る高速ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ を実装ã—ãŸã¨ã„ã†è©±ã‚’èžã‹ãªã‹ã£ãŸã®ã§ã€è‡ªåˆ†ã§ç¢ºã‹ã‚ã‚‹ã“ã¨ã«ã—ãŸã€‚ å‹•ç”»ã®ãŠããˆã•ã‚“ã¯æ·±ã•å„ªå…ˆæŽ¢ç´¢ã«ã‚ˆã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ を使ã£ã¦ã„ã‚‹ã¨æ€ã‚れるãŒã€ãã‚Œã ã¨ã‚¹ãƒ‘コンを使ã£ã¦ã‚‚10×10マスã®æ ¼åを解ãã®ã«25万年も掛ã‹ã£ã¦ã—ã¾ã†ã€‚ãã“ã§ã€é«˜é€ŸåŒ–ã®ãŸã‚
BDDs - Binary Decision Diagrams
Take a map of mainland USA, and consider the following problems: Suppose you want to visit every state capitol exactly once, traveling on highways. Which route is shortest? Which route is longest? What is the mean and standard deviation of all the routes? Weight the states by any means, for example, by reading their two-letter code as a number in base 36. Then find a set of states such that no two
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Combine - an OCaml library for combinatorics
GitHub - takemaru/graphillion: Fast, lightweight graphset operation library
GitHub - utisam/boloq: BDD/ZDD library to replesent boolean functions using modern C++ features
Dr. Atsushi Takizawa - リンク
GitHub - kunisura/TdZdd: A top-down/breadth-first decision diagram manipulation framework
PVS/BDD/bdd.lisp at master · ysz/PVS · GitHub
{{#tags}}- {{label}}
{{/tags}}