[B! algorithm] sora_hã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

sora_h id:sora_h

algorithmã«é–¢ã™ã‚‹sora_hã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (32)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

ã‚·ãƒ£ãƒŸã‚¢ã®ç§˜å¯†åˆ†æ•£æ³•ã§ç§˜å¯†ã®ãƒ‡ãƒ¼ã‚¿ã‚’åˆ†å‰²ç®¡ç†ã™ã‚‹ - Kim's Tech Blog
ã¤ã„æœ€è¿‘PollyPassHashã¨ã„ã†æ–°ã—ã„ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ç®¡ç†æ‰‹æ³•ã‚’çŸ¥ã‚Šã¾ã—ãŸã€‚ PolyPassHashingã«ã¤ã„ã¦ã¯æ™‚é–“ãŒã‚ã‚Œã°åˆ¥ã®ãƒã‚¹ãƒˆã§æ›¸ãã¾ã™ãŒã€è¦ç´„ã™ã‚‹ã¨ã€ã‚ã‚‹ä¸€å®šæ•°ã®ç®¡ç†è€…ã®æ£ã—ã„ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ãŒå…¥åŠ›ã•ã‚Œãªã„ã¨æš—å·åŒ–ã•ã‚ŒãŸãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‚’å¾©å·åŒ–ã§ããªã„ã‚ˆã†ã«ã™ã‚‹ãŸã‚ã®ä»•çµ„ã¿ã§ã™ã€‚ ã“ã®ãƒã‚¹ãƒˆã§ã¯PolyPassHashingã®ä¸æ ¸ã®æš—å·æŠ€è¡“ã§ã‚ã‚‹ ã‚·ãƒ£ãƒŸã‚¢ã®ç§˜å¯†åˆ†æ•£æ³• ã®ç´¹ä»‹ã¨ãã‚Œã‚’å®Ÿç¾ã™ã‚‹æ•°å¦çš„ãªä»•çµ„ã¿ã‚’è§£èª¬ã—ãŸã„ã¨æ€ã„ã¾ã™ã€‚ ã“ã®è¨˜äº‹ã®å†…å®¹ ã‚·ãƒ£ãƒŸã‚¢ã®ç§˜å¯†åˆ†æ•£æ³•ã¨ã¯ãªã«ã‹ ç”¨èªž å®Ÿéš›ã«ã‚„ã£ã¦ã¿ã‚‹: Rubyã§ã‚·ãƒ£ãƒŸã‚¢ã®ç§˜å¯†åˆ†æ•£ ä»•çµ„ã¿ ã‚·ã‚§ã‚¢ã®è¨ˆç®— ã‚·ãƒ¼ã‚¯ãƒ¬ãƒƒãƒˆã®å¾©å…ƒ ã‚·ãƒ£ãƒŸã‚¢ã®ç§˜å¯†åˆ†æ•£æ³•ã¨ã¯ãªã«ã‹ åå‰ã‹ã‚‰ã‚ã‹ã‚‹ã¨ãŠã‚Šã€ã‚·ãƒ£ãƒŸã‚¢ã®ç§˜å¯†åˆ†æ•£æ³•ã¯RSAã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã‚‚è²¢çŒ®ã—ãŸæœ‰åãªã‚¤ã‚¹ãƒ©ã‚¨ãƒ«äººã®æš—å·ç ”ç©¶è€…ã‚¢ãƒ‡ã‚£ãƒ»ã‚·ãƒ£ãƒŸã‚¢ã«ã‚ˆã£ã¦ä½œã‚‰ã‚Œã¾ã—ãŸã€‚ ã‚·ãƒ£ãƒŸã‚¢ã®ç§˜å¯†åˆ†æ•£æ³•ã¯ç§˜
sora_h 2015/04/30
algorithm

crypt
ãƒªãƒ³ã‚¯
Exponential Backoff And Jitter | Amazon Web Services
AWS Architecture Blog Exponential Backoff And Jitter Update (May 2023): After 8 years, this solution continues to serve as a pillar for how Amazon builds remote client libraries for resilient systems. Most AWS SDKs now support exponential backoff and jitter as part of their retry behavior when using standard or adaptive modes. Consequently, this pattern can be leveraged without having to incorpora
sora_h 2015/03/21
design

architecture

retry

algorithm
ãƒªãƒ³ã‚¯
å¤šè…•ãƒãƒ³ãƒ‡ã‚£ãƒƒãƒˆã«ã‚ˆã‚‹è¡¨ç¤ºã‚³ãƒ³ãƒ†ãƒ³ãƒ„ã®æœ€é©åŒ– - ã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰é–‹ç™ºè€…ãƒ–ãƒã‚°
ã“ã‚“ã«ã¡ã¯ã€‚æŠ€è¡“éƒ¨æ¤œç´¢ã‚°ãƒ«ãƒ¼ãƒ—ã®åŽŸå³¶ã§ã™ã€‚ ä¸Šã®ç”»åƒã¯ã€ã‚¹ãƒžãƒ¼ãƒˆãƒ•ã‚©ãƒ³ï¼ˆãƒ–ãƒ©ã‚¦ã‚¶ç‰ˆï¼‰ã§è¦‹ãŸã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰ã®æ¤œç´¢çµæžœãƒšãƒ¼ã‚¸ã§ã™ã€‚ãƒ¬ã‚·ãƒ”ã ã‘ã§ãªãã€ãƒ‹ãƒ¥ãƒ¼ã‚¹ã‚‚è¡¨ç¤ºã•ã‚Œã¦ã„ã¾ã™ãã€‚çŒ®ç«‹ã‚„æŽ²ç¤ºæ¿ã®ã‚¹ãƒ¬ãƒƒãƒ‰ãªã©ãŒè¡¨ç¤ºã•ã‚Œã‚‹ã“ã¨ã‚‚ã‚ã‚Šã¾ã™ã€‚ ã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰ã§ã¯ã€æ¤œç´¢çµæžœãƒšãƒ¼ã‚¸ã«è¡¨ç¤ºã™ã‚‹ã‚³ãƒ³ãƒ†ãƒ³ãƒ„ã‚’ã‚¯ã‚¨ãƒªãªã©ã«å¿œã˜ã¦æœ€é©åŒ–ã—ã¦ã„ã¾ã™ã€‚æœ€é©åŒ–ã¯ã€è†¨å¤§ãªãƒã‚°ãƒ‡ãƒ¼ã‚¿ã¨æœ€æ–°ã®æ©Ÿæ¢°å¦ç¿’ã‚’ç”¨ã„ã‚‹ã“ã¨ã§ã€å®Ÿç¾ã—ã¦ã„ã¾ã™ã€‚ã“ã®ã‚¨ãƒ³ãƒˆãƒªã§ã¯ã€ã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰ã«ãŠã‘ã‚‹ã‚³ãƒ³ãƒ†ãƒ³ãƒ„æœ€é©åŒ–ã®è£å´ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ æœ€é©åŒ–ã®èƒŒæ™¯ ã‚¹ãƒžãƒ¼ãƒˆãƒ•ã‚©ãƒ³ã®æ™®åŠã«ä¼´ã£ã¦ã€ãƒ¦ãƒ¼ã‚¶ãŒåˆ©ç”¨ã™ã‚‹ãƒ—ãƒ©ãƒƒãƒˆãƒ•ã‚©ãƒ¼ãƒ ã¯ PC ã‹ã‚‰ãƒ¢ãƒã‚¤ãƒ«ã«ã‚·ãƒ•ãƒˆã—ã¤ã¤ã‚ã‚Šã¾ã™ã€‚ã‚¯ãƒƒã‚¯ãƒ‘ãƒƒãƒ‰ã«ãŠã‘ã‚‹ãƒ¢ãƒã‚¤ãƒ«åˆ©ç”¨è€…ã®å‰²åˆã‚‚ã€ã“ã“ 2 å¹´ã§ 10% ä»¥ä¸Šå¢—åŠ ã—ã¾ã—ãŸã€‚æœ€è¿‘ã§ã¯ã€60% ä»¥ä¸Šã®ãƒ¦ãƒ¼ã‚¶ãŒãƒ¢ãƒã‚¤ãƒ«ã‹ã‚‰ã‚¢ã‚¯ã‚»ã‚¹ã—ã¦ã„ã¾ã™ã€‚ ãƒ¦ãƒ¼ã‚¶ã®åˆ©ç”¨å½¢æ…‹ãŒå¤‰åŒ–ã™ã‚Œã°ã€æ¤œç´¢çµæžœãƒšãƒ¼ã‚¸ã‚‚ãã®å¤‰åŒ–ã«å¯¾
sora_h 2014/10/29
search

algorithm

cookpad
ãƒªãƒ³ã‚¯
Markov Chains
Markov chains, named after Andrey Markov, are mathematical systems that hop from one "state" (a situation or set of values) to another. For example, if you made a Markov chain model of a baby's behavior, you might include "playing," "eating", "sleeping," and "crying" as states, which together with other behaviors could form a 'state space': a list of all possible states. In addition, on top of the
sora_h 2014/10/19
markov

algorithm

visualization
ãƒªãƒ³ã‚¯
ãªã„ã‚“ãŸã‚“ã®å¤©æ°—äºˆå ±ã¨ç”»åƒå‡¦ç†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼ˆ2014å¹´9æœˆ13æ—¥ æƒ…å ±ç§‘å¦è‹¥æ‰‹ã®ä¼šï¼‰
ã“ã®ãƒ–ãƒ©ã‚¦ã‚¶ ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã®ã‚µãƒãƒ¼ãƒˆã¯çµ‚äº†ã—ã¾ã—ãŸã€‚ã‚µãƒãƒ¼ãƒˆã•ã‚Œã¦ã„ã‚‹ãƒ–ãƒ©ã‚¦ã‚¶ã«ã‚¢ãƒƒãƒ—ã‚°ãƒ¬ãƒ¼ãƒ‰ã—ã¦ãã ã•ã„ã€‚
sora_h 2014/09/13
æµæ¯”å¯¿ã‚¬ãƒ¼ãƒ‡ãƒ³ãƒ—ãƒ¬ã‚¤ã‚¹ã¨ç™½é‡‘å°ã«æ¬²ã—ã„ã€‚

algorithm

weather

forecast

slide
ãƒªãƒ³ã‚¯
ï¼»CEDEC 2014ï¼½ã€Œã‚²ãƒ¼ãƒ ä¸–ç•Œã‚’å‹•ã‹ã™ã‚µã‚¤ã‚³ãƒã®æ£ä½“ ã€œ å¾€å¹´ã®ãƒŠãƒ ã‚³ã‚¿ã‚¤ãƒˆãƒ«ã‹ã‚‰å¦ã¶ä¹±æ•°ã®é€²åŒ–ã¨å¿œç”¨ã€ - 4Gamer.net
ï¼»CEDEC 2014ï¼½ãƒŠãƒ ã‚³ä½œå“ã§è¦‹ã‚‹ä¹±æ•°ã®æ´å²ã€‚ã€Œã‚²ãƒ¼ãƒ ä¸–ç•Œã‚’å‹•ã‹ã™ã‚µã‚¤ã‚³ãƒã®æ£ä½“ ã€œ å¾€å¹´ã®ãƒŠãƒ ã‚³ã‚¿ã‚¤ãƒˆãƒ«ã‹ã‚‰å¦ã¶ä¹±æ•°ã®é€²åŒ–ã¨å¿œç”¨ã€ãƒ¬ãƒãƒ¼ãƒˆ ãƒ©ã‚¤ã‚¿ãƒ¼ï¼šç®æœ¬é€²ä¸€ ç¥žå¥ˆå·ã®ãƒ‘ã‚·ãƒ•ã‚£ã‚³æ¨ªæµœã§è¡Œã‚ã‚ŒãŸï¼Œã‚²ãƒ¼ãƒ é–‹ç™ºè€…å‘ã‘ã‚¤ãƒ™ãƒ³ãƒˆCEDEC 2014ã®æœ€çµ‚æ—¥ã§ã‚ã‚‹2014å¹´9æœˆ4æ—¥ï¼Œã€Œã‚²ãƒ¼ãƒ ä¸–ç•Œã‚’å‹•ã‹ã™ã‚µã‚¤ã‚³ãƒã®æ£ä½“ ã€œ å¾€å¹´ã®ãƒŠãƒ ã‚³ã‚¿ã‚¤ãƒˆãƒ«ã‹ã‚‰å¦ã¶ä¹±æ•°ã®é€²åŒ–ã¨å¿œç”¨ã€ã¨ã„ã†è¬›æ¼”ãŒè¡Œã‚ã‚ŒãŸã€‚ ç™»å£‡ã—ãŸãƒãƒ³ãƒ€ã‚¤ãƒŠãƒ ã‚³ã‚¹ã‚¿ã‚¸ã‚ªã€€HEæŠ€è¡“éƒ¨ã€€åŠ æ¥é‡ä¸€æ° ã“ã®è¬›æ¼”ã®ãƒ¦ãƒ‹ãƒ¼ã‚¯ãªç‚¹ã¯ï¼Œæ—§ãƒŠãƒ ã‚³ã®ä½œå“ã‚’ã€Œä¹±æ•°ã€ã¨ã„ã†è¦–ç‚¹ã‹ã‚‰æŒ¯ã‚Šè¿”ã‚‹ã¨ã„ã†ã“ã¨ã ã€‚ãƒãƒ³ãƒ€ã‚¤ãƒŠãƒ ã‚³ã‚¹ã‚¿ã‚¸ã‚ªã€€HEæŠ€è¡“éƒ¨ã®ãƒ—ãƒã‚°ãƒ©ãƒžãƒ¼ã§ã‚ã‚‹åŠ æ¥é‡ä¸€æ°ã¯ï¼Œæ—§ãƒŠãƒ ã‚³ã®åˆæœŸä½œå“50æœ¬ã‚’è§£æžã—ï¼Œãã‚Œãžã‚Œã®æ™‚ä»£ã§ã©ã®ã‚ˆã†ãªä¹±æ•°ãŒä½¿ã‚ã‚Œã¦ã„ãŸã‹ã‚’ç‰¹å®šã—ãŸã€‚ãã“ã‹ã‚‰è¦‹ãˆã¦ãã‚‹ä¹±æ•°æŠ€è¡“æ”¹è‰¯ã®æ´å²ã‚’è¦‹ã¦ã„ãã¨ã„ã†ã®ãŒï¼Œè¬›ç¾©ã®ä¸»æ—¨ãªã®ã§ã‚ã‚‹ã€‚ 1980å¹´ä»£ã®ãƒŠãƒ ã‚³ã‚¢ãƒ¼ã‚±
sora_h 2014/09/12
game

history

algorithm
ãƒªãƒ³ã‚¯
Raft:Understandable Distributed Consensus
sora_h 2014/05/30
raft

algorithm
ãƒªãƒ³ã‚¯
Raft: The Understandable Distributed Consensus Protocol
Raft presentation at Strange Loop 2013. Video: http://www.infoq.com/presentations/raft This work is licensed under a Creative Commons Attribution â€¦
sora_h 2014/04/20
ã‚ã‹ã‚Šã‚„ã™ã„

raft

algorithm

slide
ãƒªãƒ³ã‚¯
http://raftconsensus.github.io/
sora_h 2014/01/17
raft

algorithm
ãƒªãƒ³ã‚¯
SmartNewsã‚’æ”¯ãˆã‚‹æ©Ÿæ¢°å¦ç¿’
ãƒ‹ãƒ¥ãƒ¼ã‚¹ã‚¢ãƒ—ãƒªSmartNews(https://www.smartnews.be/)ã®èƒŒæ™¯ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦TokyoWebMining30th(http://tokyowebmining30.eventbrite.com/)ã§è©±ã•ã›ã¦ã„ãŸã ã„ãŸéš›ã®è³‡æ–™ã§ã™ã€‚ â€¢SmartNews iphoneç‰ˆ: https://itunes.apple.com/jp/app/id579581125 â€¢SmartNews Androidç‰ˆ https://play.google.com/store/apps/details?id=jp.gocro.smartnews.android â€¢SmartNewsé–‹ç™ºè€…ãƒ–ãƒã‚° http://developer.smartnews.be/blog/
sora_h 2013/10/20
algorithm

smartnews

slide

machine-learning

natural-language-programming
ãƒªãƒ³ã‚¯
Quick-sort with Hungarian (KÃ¼kÃ¼llÅ‘menti legÃ©nyes) folk dance
Created at Sapientia University, Tirgu Mures (MarosvÃ¡sÃ¡rhely), Romania. Directed by KÃ¡tai ZoltÃ¡n and TÃ³th LÃ¡szlÃ³. In cooperation with "Maros MÅ±vÃ©szegyÃ¼ttes", Tirgu Mures (MarosvÃ¡sÃ¡rhely), Romania. Choreographer: FÃ¼zesi Albert. Video: LÅ‘rinc Lajos, KÃ¶rmÃ¶cki ZoltÃ¡n. Supported by "SzÃ¼lÅ‘fÃ¶ld Alap", MITIS (NGO) and evoline company. Click the link below to watch this visualization included in the
sora_h 2013/09/30
algorithm
ãƒªãƒ³ã‚¯
Graphillion: æ•°ãˆä¸Šã’ãŠããˆã•ã‚“ã‚’æ•‘ãˆ / Don't count naively
Graphillion ã¯è†¨å¤§ãªæ•°ã®ã‚°ãƒ©ãƒ•ã«å¯¾ã—ã¦æ¤œç´¢ã‚„æœ€é©åŒ–ã€åˆ—æŒ™ã‚’è¡Œã†ãŸã‚ã® Python ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã§ã™ã€‚ã“ã®ãƒ“ãƒ‡ã‚ªã¯ Graphillion ã®æ¦‚è¦ã‚’çŸ¥ã‚‹ãŸã‚ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã§ã™ã€‚ã€Œãƒ•ã‚«ã‚·ã‚®ã®æ•°ãˆæ–¹ã€ http://youtu.be/Q4gTV4r0zRs ã®ç¶šç·¨ã¨ã—ã¦ä½œæˆã•ã‚Œã¾ã—ãŸã€‚ Graphillion is a Python software package on search, optimization, and enumeration for a very large set of graphs. This video is a quick tutorial to learn what Graphillion is. The story follows our previous episode, "Let's count!" http://youtu.be/Q4gT
sora_h 2013/06/20
graph

graphillion

algorithm

python

library
ãƒªãƒ³ã‚¯
ç§’é–“3å„„æ‰‹ã‚’èªã‚€æœ€å¼·ã‚½ãƒ•ãƒˆã€ŒGPSå°†æ£‹ã€ã¯ã„ã‹ã«ã—ã¦æ•—ã‚ŒãŸã‹ - æœ€å¼·ç«¶ã†çŸ¥ã®ç¥å…¸ã€Œç¬¬23å›žä¸–ç•Œã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿å°†æ£‹é¸æ‰‹æ¨©ã€
ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã€å°†æ£‹ã€ã¨èžã‘ã°ã€Œç¬¬2å›ž å°†æ£‹é›»çŽ‹æˆ¦ã€ã‚’æ€ã„å‡ºã™æ–¹ã‚‚å¤šã„ã¯ãšã€‚å°†æ£‹ã®ãƒ—ãƒæ£‹å£«ã¨ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã«ã‚ˆã‚‹5å¯¾5ã®å›£ä½“æˆ¦ãŒè¡Œã‚ã‚Œã€ãã®çµæžœã¯ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿å´ãŒ3å‹1æ•—1åˆ†ã§å‹ã¡è¶Šã—ã€‚ã“ã®çµæœ«ã¯ã•ã¾ã–ã¾ãªãƒ¡ãƒ‡ã‚£ã‚¢ã§å–ã‚Šä¸Šã’ã‚‰ã‚Œã€å¤§ããªè©±é¡Œã«ãªã£ãŸã€‚ ãƒ—ãƒæ£‹å£«ã«ã‚‚å‹ã¤ã»ã©ã®æã‚ã—ã„å¼·ã•ã«ãªã£ãŸãƒ—ãƒã‚°ãƒ©ãƒ ãŒé›†ã¾ã‚Šã€ä¸–ç•Œä¸€ã®åº§ã‚’äº‰ã†ã®ãŒã“ã®é¸æ‰‹æ¨©ã§ã‚ã‚‹ã€‚äººé–“åŒå£«ã®å¯¾å±€ã¨ã¯ä¸€å‘³é•ã£ãŸé…åŠ›ã‚’æŒã¤ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿å°†æ£‹ã€ãã®æœ€é«˜å³°ã®æˆ¦ã„ã®æ¨¡æ§˜ã‚’ãŠä¼ãˆã—ã‚ˆã†ã€‚ çŸ¥ã®F1! è¶…ã‚¹ãƒ”ãƒ¼ãƒ‰ã®ä¸–ç•Œ ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿å°†æ£‹ã¯å¼·ã„! ã¨è¨€ã‚ã‚Œã¦ã„ã‚‹ãŒã€ãã‚‚ãã‚‚ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿å°†æ£‹ã¨ã¯ã©ã‚“ãªã‚‚ã®ãªã®ã‹ã€‚ã¾ãšã¯ã‚¤ãƒ¡ãƒ¼ã‚¸ã‚’ã¤ã‹ã‚€ãŸã‚ã«ã€ãŸã¨ãˆè©±ã§è¼ªéƒã‚’æã„ã¦ã¿ãŸã„ã€‚ ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿å°†æ£‹ã¯ã€å°†æ£‹ã®æ‰‹ã‚’æ±ºã‚ã‚‹æ€è€ƒéƒ¨åˆ†(ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢)ã¨ã€ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’å‹•ã‹ã™ãƒžã‚·ãƒ³(ãƒãƒ¼ãƒ‰ã‚¦ã‚§ã‚¢)ã«åˆ†ã‹ã‚Œã‚‹ãŒã€ã“ã‚Œã‚’è»Šã«ãŸã¨ãˆã¦ã¿ã‚ˆã†ã€‚ã™ã‚‹ã¨å°†æ£‹ã¯ã€Œã‚´ãƒ¼ãƒ«ãŒè¨å®šã•ã‚Œ
sora_h 2013/05/13
algorithm

game

shogi

computer
ãƒªãƒ³ã‚¯
Big-O Algorithm Complexity Cheat Sheet (Know Thy Complexities!) @ericdrowell
Hi there!Â This webpage covers the space and time Big-O complexities of common algorithms used in Computer Science.Â When preparing for technical interviews in the past, I found myself spending hours crawling the internet putting together the best, average, and worst case complexities for search and sorting algorithms so that I wouldn't be stumped when asked about them.Â Over the last few years, I
sora_h 2013/05/11
algorithm

cheetsheet
ãƒªãƒ³ã‚¯
SIGMOD'13 ã«è«–æ–‡æŽ¡æŠž - iwiwiã®æ—¥è¨˜
è«–æ–‡ãŒå›½éš›å¦ä¼š SIGMOD'13 (ACM SIGMOD International Conference on Management of Data) ã«æŽ¡æŠžã•ã‚Œã¾ã—ãŸï¼ŽSIGMOD ã¯ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹åˆ†é‡Žã®ãƒˆãƒƒãƒ—ä¼šè°ã§ã™ï¼Žæ—¥æœ¬ã‹ã‚‰ã®è«–æ–‡ã¯çŸ¥ã‚‹é™ã‚Š 5 å¹´ã¶ã‚Šã ã¨æ€ã„ã¾ã™ï¼Žä¿®å£«ã®é–“ã®ç ”ç©¶ã§ï¼Œã“ã®åŽ³ã—ã„æˆ¦ã„ã‚’å‹ã¡æŠœãè«–æ–‡æŽ¡æŠžã«è‡³ã‚‹ã“ã¨ãŒã§ãï¼Œæœ¬å½“ã«å¬‰ã—ã„ã§ã™ï¼Ž è«–æ–‡ã¯ "Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling" ã¨ã„ã†ã‚¿ã‚¤ãƒˆãƒ«ã§ï¼Œç ”ç©¶å®¤åŒæœŸã®å²©ç”°ã¨ NII ã®å‰ç”°ã•ã‚“ã¨ã®å…±åŒç ”ç©¶ã§ã™ï¼Ž å†…å®¹ã«ã¤ã„ã¦ æ‰±ã£ã¦ã„ã‚‹å•é¡Œã¯å‰å›žã® EDBT è«–æ–‡ã¨åŒã˜ãï¼Œå¤§è¦æ¨¡ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ä¸Šã®æœ€çŸè·¯ã‚¯ã‚¨ãƒªã§ã™ï¼Žã‚°ãƒ©ãƒ•ã«å¯¾ã—ï¼Œã‚ã‚‹ç¨‹åº¦ã®å‰è¨ˆç®—ãƒ‡ãƒ¼ã‚¿ã‚’è“„ãˆã¦ãŠãäº‹ã«ã‚ˆã‚Šï¼Œ2 ç‚¹é–“ã®æœ€çŸ
sora_h 2013/04/07
sigmod

paper

algorithm

acm
ãƒªãƒ³ã‚¯
ã„ã‚‚ã™æ³• - ã„ã‚‚ã™ç ” (imos laboratory)
ã„ã‚‚ã™æ³•ã¨ã¯ï¼Œç´¯ç©å’Œã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’å¤šæ¬¡å…ƒï¼Œå¤šæ¬¡æ•°ã«æ‹¡å¼µã—ãŸã‚‚ã®ã§ã™ï¼Žç«¶æŠ€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã¯ 2 æ¬¡å…ƒ 1 æ¬¡ã®ã‚‚ã®ã¾ã§ã—ã‹å‡ºé¡Œã•ã‚Œã¾ã›ã‚“ãŒï¼Œ2012 å¹´ã®ç ”ç©¶æˆæžœã¨ã—ã¦ã“ã‚Œã‚’ã‚ˆã‚Šé«˜æ¬¡å…ƒã®ç©ºé–“ã«ã‚ˆã‚Šé«˜æ¬¡æ•°ã®ã„ã‚‚ã™æ³•ã‚’é©ç”¨ã™ã‚‹ã“ã¨ã«ã‚ˆã‚Šä¿¡å·å‡¦ç†åˆ†é‡Žãƒ»ç”»åƒå‡¦ç†åˆ†é‡Žã«ãŠã„ã¦åˆ©ä¾¿æ€§ãŒã‚ã‚‹ã“ã¨ãŒã‚ã‹ã£ã¦ã„ã¾ã™ï¼Ž ã„ã‚‚ã™æ³•ã®åŸºæœ¬: 1 æ¬¡å…ƒ 0 æ¬¡ã„ã‚‚ã™æ³• æœ€ã‚‚ã‚·ãƒ³ãƒ—ãƒ«ãªã€Œã„ã‚‚ã™æ³•ã€ã¯ 1 æ¬¡å…ƒä¸Šã« 0 æ¬¡é–¢æ•°ï¼ˆçŸ©å½¢é–¢æ•°ã‚„éšŽæ®µé–¢æ•°ãªã©ã®ã‚ˆã†ã«ä¸Šéƒ¨ãŒå¹³ã‚‰ãªé–¢æ•°ï¼‰ã‚’è¶³ã™ã‚‚ã®ã§ã™ï¼Ž å•é¡Œä¾‹ ã‚ãªãŸã¯å–«èŒ¶åº—ã‚’çµŒå–¶ã—ã¦ã„ã¾ã™ï¼Žã‚ãªãŸã®å–«èŒ¶åº—ã‚’è¨ªã‚ŒãŸãã‚Œãžã‚Œã®ãŠå®¢ã•ã‚“ i\ (0 \leq i \lt C) ã«ã¤ã„ã¦å…¥åº—æ™‚åˆ» S_i ã¨å‡ºåº—æ™‚åˆ» E_i ãŒä¸Žãˆã‚‰ã‚Œã¾ã™ï¼ˆ0 \leq S_i \lt E_i \leq Tï¼‰ï¼ŽåŒæ™‚åˆ»ã«ãŠåº—ã«ã„ãŸå®¢ã®æ•°ã®æœ€å¤§å€¤ M ã¯ã„ãã¤ã§ã—ã‚‡ã†ã‹ï¼ŽãŸã ã—ï¼ŒåŒæ™‚åˆ»ã«å‡ºåº—ã¨å…¥åº—ãŒã‚ã‚‹å ´
sora_h 2012/12/22
imos_method

algorithm
ãƒªãƒ³ã‚¯
Schwartzian transform - Wikipedia
This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (February 2024) (Learn how and when to remove this message) In computer programming, the Schwartzian transf orm is a technique used to improve the efficiency of sorting a list of it ems. This idiom[1] is appropriate for
sora_h 2012/12/12
perl

cs

algorithm

sorting
ãƒªãƒ³ã‚¯
ï¼»SQEXOC 2012ï¼½FFXIVã§ä½¿ã‚ã‚Œã¦ã„ã‚‹AIæŠ€è¡“ã€œæ•µNPCã¯ã©ã†ã‚„ã£ã¦çµŒè·¯ã‚’æŽ¢ç´¢ã—ã¦ã„ã‚‹ã®ã‹ï¼Ÿ
ï¼»SQEXOC 2012ï¼½FFXIVã§ä½¿ã‚ã‚Œã¦ã„ã‚‹AI æŠ€è¡“ã€œæ•µNPCã¯ã©ã†ã‚„ã£ã¦çµŒè·¯ã‚’æŽ¢ç´¢ã—ã¦ã„ã‚‹ã®ã‹ï¼Ÿ ãƒ©ã‚¤ã‚¿ãƒ¼ï¼šç±³ç”° è¡ ã‚¹ã‚¯ã‚¦ã‚§ã‚¢ãƒ»ã‚¨ãƒ‹ãƒƒã‚¯ã‚¹ãŒ2012å¹´11æœˆ23æ—¥ã¨24æ—¥ã®ä¸¡æ—¥é–‹å‚¬ã—ãŸã€Œã‚¹ã‚¯ã‚¦ã‚§ã‚¢ãƒ»ã‚¨ãƒ‹ãƒƒã‚¯ã‚¹ ã‚ªãƒ¼ãƒ—ãƒ³ã‚«ãƒ³ãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã€ã®æœ€å¾Œã«ã¯ã€ŒAIã‚»ãƒƒã‚·ãƒ§ãƒ³ã€ãŒç”¨æ„ã•ã‚Œã¦ã„ãŸã€‚AIã‚»ãƒƒã‚·ãƒ§ãƒ³ã¯å‰åŠã¨å¾ŒåŠã«åˆ†ã‹ã‚Œï¼Œå‰åŠã¯ã€Œãƒ•ã‚¡ã‚¤ãƒŠãƒ«ãƒ•ã‚¡ãƒ³ã‚¿ã‚¸ãƒ¼XIV: æ–°ç”Ÿã‚¨ã‚ªãƒ«ã‚¼ã‚¢ã€ï¼ˆä»¥ä¸‹ï¼Œæ–°ç”ŸFFXIVï¼‰ã«ãŠã‘ã‚‹çµŒè·¯æŽ¢ç´¢ã®å®Ÿè£…ã«é–¢ã™ã‚‹å®Ÿè·µçš„ãªè§£èª¬ï¼Œå¾ŒåŠã¯ã‚²ãƒ¼ãƒ AIã®ç¬¬ä¸€äººè€…ã¨ã‚‚è©•ã•ã‚Œã‚‹ä¸‰å®…é™½ä¸€éƒŽæ°ã«ã‚ˆã‚‹ï¼ŒLuminous Studioç”¨AIã‚¨ãƒ³ã‚¸ãƒ³ã®ã‚„ã‚„æ¦‚å¿µçš„ãªè©±ã¨ã„ã†æ§‹æˆã ã£ãŸã€‚æœ¬ç¨¿ã§ã¯ï¼Œã¾ãšå‰åŠã®ï¼Œã‚ˆã‚Šå®Ÿè·µçš„ãªã‚»ãƒƒã‚·ãƒ§ãƒ³ã‹ã‚‰ç´¹ä»‹ã—ã¦ã¿ãŸã„ã€‚ ãƒ†ãƒ¼ãƒžã¯ï¼Œã€ŒMMO RPGã§ãƒžãƒƒãƒ—ä¸Šã‚’ç§»å‹•ã™ã‚‹æ•µNPCã®çµŒè·¯ã‚’ã©ã†æ±ºã‚ã‚‹ã®ã‹ã€ã§ã‚ã‚‹ã€‚è¤‡é›‘ã§åºƒã„ãƒžãƒƒãƒ—ã‚’æœ‰ã™ã‚‹MMO RPGã§ã¯ï¼Œç§»å‹•ã™ã‚‹çµŒè·¯ã‚’è³¢ãé¸æŠž
sora_h 2012/12/09
game

algorithm

ai

ffxiv
ãƒªãƒ³ã‚¯
Genetic programming
sora_h 2012/08/31
ãƒ‡ãƒ‡ãƒ‰ãƒ³

slide

gp

geneticalgorithm

algorithm

genetic
ãƒªãƒ³ã‚¯
é«˜å±¤ãƒ“ãƒ«ã®ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ãƒ›ãƒ¼ãƒ«ã«ã¯ã€ãªãœéšŽæ•°è¡¨ç¤ºãŒãªã„ã®ã‹ - æœ¬å½“ã¯æ€–ã„HPC & AI
ä»¥å‰ã«é«˜æ©‹å¹¸é›„å…ˆç”Ÿã®æŽˆæ¥ã§èžã„ã¦éžå¸¸ã«é¢ç™½ã„ã¨æ€ã£ãŸã“ã¨ã€‚ ã‚ªãƒ•ã‚£ã‚¹ãƒ“ãƒ«ã¨ã‹ãƒ›ãƒ†ãƒ«ã¨ã‹ã€ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ãŒä½•åŸºã‚‚è¨ç½®ã•ã‚Œã¦ã„ã‚‹ãƒ“ãƒ«ã®å ´åˆã€ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ãƒ›ãƒ¼ãƒ«ã«éšŽæ•°è¡¨ç¤ºãŒç„¡ã„ã“ã¨ãŒå¤šã„ã€‚ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ãƒ›ãƒ¼ãƒ«ã§ç”»åƒæ¤œç´¢ã—ã¦ã¿ã‚Œã°ã‚ã‹ã‚‹ã¨æ€ã†ã€‚ ã“ã‚Œã¯ãªãœã ã‚ã†ã‹ã€‚ ãã®ç†ç”±ã¯ã€ã€Œå®¢ãŒã„ã¦ã‚‚ã€ãã®éšŽã‚’é€šéŽã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã‚ˆã†ã«ã™ã‚‹ãŸã‚ã€ã ã€‚ åŸºæœ¬çš„ã«ã€å¤šæ•°ã®ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã‚’åŠ¹çŽ‡ã‚ˆãå‹•ã‹ã™ã®ã¯é›£ã—ã„ã€‚å·¥å¤«ã•ã‚ŒãŸé«˜åº¦ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒä½¿ã‚ã‚Œã¦ã„ã‚‹ã“ã¨ãŒå¤šã„ã€‚ç›®æ¨™ã¯ã€Œå®¢ã®å¹³å‡å¾…ã¡æ™‚é–“ã‚’çŸãã™ã‚‹ã€ã“ã¨ã ã€‚ã‚ã‚‹éšŽã§ãƒœã‚¿ãƒ³ãŒæŠ¼ã•ã‚ŒãŸå ´åˆã€ã©ã®ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ãŒãã®å®¢ã‚’è¿Žãˆã«è¡Œãã‹ã€ã¨ã„ã†åˆ¤æ–ãŒå¹³å‡å¾…ã¡æ™‚é–“ã«å¤§ããªå½±éŸ¿ã‚’ä¸Žãˆã‚‹ã€‚é›£ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ä¸ã§ã€ã“ã®ç‚¹ãŒã‚‚ã£ã¨ã‚‚é‡è¦ãªã¨ã“ã‚ã ã€‚ é«˜å±¤ãƒ“ãƒ«ã®å ´åˆã€ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ã¯ã‹ãªã‚Šã®é€Ÿåº¦ã§èµ°ã£ã¦ã„ã‚‹ã€‚æ—¢ã«å®¢ã‚’ä¹—ã›ã¦èµ°ã£ã¦ã„ã‚‹ã‚¨ãƒ¬ãƒ™ãƒ¼ã‚¿ãƒ¼ãŒä»–ã®å®¢ã‚’ä¹—ã›ã‚‹ãŸã‚ã«åœæ¢ã™ã‚‹ã¨ã€æ¸›é€Ÿâ†’åœæ¢â†’
sora_h 2012/08/27
elevator

algorithm

building
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸