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

Hash id:Hash

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

${{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}}

è»½ã„æ°—æŒã¡ã§LinkedListã‚’ä½¿ã£ãŸã‚‰ä¼‘å‡ºã™ã‚‹ç¾½ç›®ã«ãªã£ãŸè©± - Qiita
ã–ã£ãã‚Šè¨€ã†ã¨ ãƒªã‚¹ãƒˆæ§‹é€ ã®ãƒ‡ãƒ¼ã‚¿ã«å¯¾ã—ã¦ãƒ©ãƒ³ãƒ€ãƒ ã‚¢ã‚¯ã‚»ã‚¹ã¯ã—ã¡ã‚ƒã ã‚ã ãžã€‚ãŠå…„ã•ã‚“ã¨ã®ç´„æŸã ï¼ ç™ºç«¯ æ•°å¹´å‰ã«ä»–éƒ¨ç½²ã®æ”¯æ´ã§ä½œã£ãŸJavaã®ã‚·ã‚¹ãƒ†ãƒ ã«ã€ã¡ã‚‡ã£ã¨ãƒ‡ã‚«ã‚ã®ãƒ‡ãƒ¼ã‚¿ã‚’çªã£è¾¼ã‚“ã ã‚‰ã‚ã‚Šãˆãªã„ã»ã©é…ã„ã®ã§åŠ©ã‘ã¦ãã‚Œã€ã¨é€£çµ¡ãŒå…¥ã£ãŸã€‚ ã¾ãã‚¯ã‚¨ãƒªã¨ã‹ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã‚’ã¡ã‚‡ã£ã¨è¦‹ã‚Œã°ç›´ã‚‹ã£ã—ã‚‡ãƒ»ãƒ»ãƒ»ã¨é¼»ã‚’ã»ã˜ã‚ŠãªãŒã‚‰æ”¯æ´ã«å‘ã‹ã£ãŸã€‚ å‡¦ç†å†…å®¹ é…ã„éƒ¨åˆ†ã®å‡¦ç†ã¯ä»¥ä¸‹ã®ã‚ˆã†ãªã‚‚ã®ã§ã‚ã£ãŸã€‚ å‡¦ç†å¯¾è±¡ã®ãƒ‡ãƒ¼ã‚¿ã‚’Listã§å—ã‘å–ã‚‹ã€‚ ãã‚Œã‚’forãƒ«ãƒ¼ãƒ—ã§1ä»¶ãšã¤å‰å‡¦ç†ã™ã‚‹ã€‚ å‡¦ç†çµæžœã‚’ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã«æ ¼ç´ã—ã€ORãƒžãƒƒãƒ‘ãƒ¼ã§DBã«INSERTã™ã‚‹ã€‚ ã“ã‚Œã ã‘ï¼Ÿ ãã†ã€ã“ã‚Œã ã‘ã ã€‚ä¸¦åˆ—å‡¦ç†ãªã‚“ã¦é«˜ç´šãªã“ã¨ã¯ã‚‚ã¡ã‚ã‚“ã‚„ã£ã¦ãªã„ã€‚ ã‚¤ãƒ³ãƒ•ãƒ©èª¿æŸ» å‡¦ç†ä¸ã®ã‚µãƒ¼ãƒã®ã‚ˆã†ã™ã‚’èª¿æŸ»ã™ã‚‹ã€‚ä»Šå›žã®ã‚¤ãƒ³ãƒ•ãƒ©ã¯å…¸åž‹çš„ãª3å±¤3ã‚µãƒ¼ãƒæ§‹æˆã€‚ WEBã‚µãƒ¼ãƒã¯ãªã«ã‚‚ã‹ã‚‚ãŒä½™è£•ã€‚ APã‚µãƒ¼ãƒã§ã¯CPUã‚’1ã¤ä½¿ã„åˆ‡ã£ã¦ã„ã‚‹ã€‚ 14ã‚³ã‚¢
Hash 2018/02/24
ã‚ãˆã¦ã® LinkedList... ã‚³ãƒ¡ãƒ³ãƒˆæ¬„å«ã‚å‹‰å¼·ã«ãªã‚‹ / ã“ã†è¡¨ã‚Œã‚‹ã¨ã„ã†å®Ÿä¾‹ / ãƒ—ãƒãƒ•ã‚¡ã‚¤ãƒ©ä½¿ã†ã¨å‡ºåŠ›ã©ã‚“ãªæ„Ÿã˜ã ã£ãŸã‹

java

algorithm
ãƒªãƒ³ã‚¯
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
Hash 2017/04/18
AWS

algorithm

ã‚ã¨ã§
ãƒªãƒ³ã‚¯
Red Blob Games: Hexagonal Grids
Mar 2013, updated in Mar 2015, Apr 2018, Feb 2019, May 2020, Oct 2021, Dec 2022, Feb 2023, Oct 2024, Mar 2025 This guide will cover various ways to make hexagonal grids, the relationships between different approaches, and common formulas and algorithms. I've been collecting hex grid resources[1] for over 25 years. I wrote this guide to the most elegant approaches that lead to the simplest code, st
Hash 2017/03/17
ã‚ã£ã¡ã‚ƒãŠã‚‚ã—ã‚ã„

algorithm

Geometry

programming

data_structure
ãƒªãƒ³ã‚¯
The power of two random choices - Marc's Blog
Hash 2016/10/13
ã‚ã¨ã§

algorithm
ãƒªãƒ³ã‚¯
TCP Performance problems caused by interaction between Nagleâ€™s Algorithm and Delayed ACK
TCP Performance probl ems caused by interaction between Nagleâ€™s Algorithm and Delayed ACK Stuart Cheshire 20th May 2005 This page describes a TCP performance probl em resulting from a little-known interaction between Nagleâ€™s Algorithm and Delayed ACK. At least, I believe itâ€™s not well known: I havenâ€™t seen it documented elsewhere, yet in the course of my career at Apple I have run into the performan
Hash 2016/07/06
ã“ã‚Œã , Nagel ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨é…å»¶ ACK ã®ã‚„ã¤

algorithm

network
ãƒªãƒ³ã‚¯
Lamport timestamp - Wikipedia
The Lamport timestamp algorithm is a simple logical clock algorithm used to determine the order of events in a distributed computer system. As different nodes or processes will typically not be perfectly synchronized, this algorithm is used to provide a partial ordering of events with minimal overhead, and conceptually provide a starting point for the more advanced vector clock method. The algorit
Hash 2016/01/11
"a simple algorithm used to determine the order of events in a distributed computer system." minimal overhead ã§åŠé †åº(partial order)ã‚’æä¾›ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ . ã“ã®å…ˆã« vector clock ãƒ¡ã‚½ãƒƒãƒ‰ã¸å¿œç”¨å¯èƒ½

wikipedia

algorithm
ãƒªãƒ³ã‚¯
å·¡å›žå†—é•·æ¤œæŸ» - Wikipedia
å·¡å›žå†—é•·æ¤œæŸ»ï¼ˆã˜ã‚…ã‚“ã‹ã„ã˜ã‚‡ã†ã¡ã‚‡ã†ã‘ã‚“ã•ã€è‹±: Cyclic Redundancy Check, CRCï¼‰ã¯ã€èª¤ã‚Šæ¤œå‡ºç¬¦å·ã®ä¸€ç¨®ã§ã€ä¸»ã«ãƒ‡ãƒ¼ã‚¿è»¢é€ãªã©ã«ä¼´ã†å¶ç™ºçš„ãªèª¤ã‚Šã®æ¤œå‡ºã«ã‚ˆãä½¿ã‚ã‚Œã¦ã„ã‚‹ã€‚é€ä¿¡å´ã¯å®šã‚ã‚‰ã‚ŒãŸç”Ÿæˆå¤šé …å¼ã§é™¤ç®—ã—ãŸä½™ã‚Šã‚’æ¤œæŸ»ãƒ‡ãƒ¼ã‚¿ã¨ã—ã¦ä»˜åŠ ã—ã¦é€ä¿¡ã—ã€å—ä¿¡å´ã§åŒã˜ç”Ÿæˆå¤šé …å¼ã‚’ä½¿ç”¨ã—ã¦ãƒ‡ãƒ¼ã‚¿ã‚’é™¤ç®—ã—ã€ãã®ä½™ã‚Šã‚’æ¯”è¼ƒç…§åˆã™ã‚‹ã“ã¨ã«ã‚ˆã£ã¦å—ä¿¡ãƒ‡ãƒ¼ã‚¿ã®èª¤ã‚Šãƒ»ç ´æã‚’æ¤œå‡ºã™ã‚‹ã€‚ ãƒ‡ã‚¸ã‚¿ãƒ«å›žè·¯ã§ç°¡å˜ã«å®Ÿè£…ã§ãã€æ•°å¦çš„ã«ã‚‚åˆ†æžãŒå®¹æ˜“ã§ã‚ã‚Šã€ã¾ãŸã€ãƒ“ãƒƒãƒˆã®ãƒ©ãƒ³ãƒ€ãƒ èª¤ã‚Šã‚„ãƒãƒ¼ã‚¹ãƒˆèª¤ã‚Šã‚’æ¤œå‡ºã§ãã‚‹ã®ã§ã€HDLCæ‰‹é †ã‚„CSMA/CDæ–¹å¼ãªã©ã«ãŠã„ã¦èª¤ã‚Šãƒã‚§ãƒƒã‚¯ãƒ»ä¼é€è·¯ãƒŽã‚¤ã‚ºãƒã‚§ãƒƒã‚¯ã«ã‚ˆãä½¿ã‚ã‚Œã¦ã„ã‚‹ã€‚ãƒ‘ãƒªãƒ†ã‚£ã‚„å˜ç´”ãªåŠ ç®—ã«ã‚ˆã‚‹ãƒã‚§ãƒƒã‚¯ã‚µãƒ ã«æ¯”ã¹æ¤œå‡ºç²¾åº¦ãŒé«˜ãã€ãã®ç‚¹ã§ã¯é«˜ç´šãªãƒã‚§ãƒƒã‚¯ã‚µãƒ ã¨è¨€ãˆã‚‹ã€‚å˜ç´”ãªãƒã‚§ãƒƒã‚¯ã‚µãƒ ã¨åŒã˜ãã€ãƒ‡ãƒ¼ã‚¿ã®æ”¹ç«„ã«å¯¾ã™ã‚‹è€æ€§ã¯ãªã„ã€‚ Wãƒ»ã‚¦ã‚§ã‚¹ãƒ¬ã‚¤ãƒ»ãƒ”ãƒ¼ã‚¿ãƒ¼ã‚½ãƒ³ãŒç™ºæ˜Žã—
Hash 2015/12/18
algorithm

security

wikipedia
ãƒªãƒ³ã‚¯
Promise Pipelining
In a conventional RPC system, each of the three calls on the left requires its own separate round trip. Typically these would be chained, causing the sequence as a whole to require three sequential round trips. Even when making maximal use of available parallelism, the "c(...)" message could not be sent until both "a()" and "b()" had returned, resulting in a minimum delay of two sequential round t
Hash 2015/07/22
Eè¨€èªž Promise ã«ã¤ã„ã¦ã®ã‚ªãƒªã‚¸ãƒŠãƒ«è¨˜è¿°

promise

lamguage

algorithm
ãƒªãƒ³ã‚¯
ã€ã¾ãŸã‹ã‚ˆã€‘ã€ŒHaskellã§ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã€å•é¡Œã€ä½•åº¦ç›®ã ã€‘
PinðŸ“AppBrew CTO @spinute ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆä½•è¡Œã ã¨æ€ã†ï¼Ÿ rubyãŒ40è¡Œã€c++ãŒ35è¡Œã€haskellã¯5è¡Œã ã‚ˆï¼Ÿ å¤§ãã„ã®ã¨å°ã•ã„ã®ã«ã¡ãŽã‚‹ã€ç©ºã ã£ãŸã‚‰çµ‚ã‚ã‚‹ã€ãã‚ŒãŒæœ¬è³ªã§ãã‚Œã ã‘ãŒå¿…è¦æœ€ä½Žé™ã€‚ ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆã®ã‚¤ãƒ‡ã‚¢ã¯äº”è¡Œã«åŽã¾ã‚‹ã‚‰ã—ã„ 2013-01-27 00:18:27
Hash 2015/07/21
Haskell

twitter

algorithm
ãƒªãƒ³ã‚¯
shi3zã•ã‚“ã®é€šä¿¡ä¸Šã®åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ åˆ©ç”¨ã®èªè˜ã¨ã€big_brosã•ã‚“ã«ã‚ˆã‚‹æŒ‡æ‘˜åŠã³åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®è§£èª¬ - Togetterã¾ã¨ã‚
ã‚¹ãƒžãƒ›å›žç·šã§ä¸Šä½ãƒ¬ã‚¤ãƒ¤ã«å¯¾ã™ã‚‹ä¸å¯é€†åœ§ç¸®ãŒè¡Œã‚ã‚Œã¦ã—ã¾ã†ã€Œé€šä¿¡ã®æœ€é©åŒ–ã€å•é¡Œ ã‚«ãƒ‰ã‚«ãƒ¯ãƒ‰ãƒ¯ãƒ³ã‚´å·ä¸Šæ°ã‚’æ“è·ã™ã‚‹UEIæ¸…æ°´æ°ã®æ„è¦‹ã¨ã€ãã®èª¤ã‚Šã«ã¤ã„ã¦æŒ‡æ‘˜ã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒžå‰è‰¯æ°ã¨ã®ã‚„ã‚Šã¨ã‚Š åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ç‰¹æ€§ã‹ã‚‰ã€é€šä¿¡ã®æœ€é©åŒ–ã®å•é¡Œç‚¹ãŒåˆ†ã‹ã‚Šã‚„ã™ã„ã®ã§ã¾ã¨ã‚ã¾ã—ãŸã€‚ ç¶šãã‚’èªã‚€
Hash 2015/07/16
å¿œç”¨ã‚‚æ®ºã™æœ›ã¾ã¬ä¸å¯é€†å¤‰æ›ã‚„ã‚ã‚ vs æ°—ã«ãªã‚‰ãªã„ãƒ¬ãƒ™ãƒ«ãªã‚‰ã„ã„ã˜ã‚ƒã‚“, ã®ã¯ãšãŒå ´å¤–ã§çŸ¥è˜ãƒžã‚¦ãƒ³ãƒ†ã‚£ãƒ³ã‚°ã«ã‚ˆã‚‹äººæ ¼æ”»æ’ƒã«å¤±æ•—ã—ã¦è¿”ã‚Šè¨Žã¡ã«ãªã£ãŸäº‹ä¾‹ã‹

twitter

algorithm
ãƒªãƒ³ã‚¯
https://peds.oxfordjournals.org/content/15/10/779.long
Hash 2015/07/07
Molecular Programming Project ã«æŽ²è¼‰ã•ã‚Œã¦ã‚‹ä¸æœ€å¤ã®è«–æ–‡ã“ã‚Œã£ã½ã„

paper

protein

algorithm

science
ãƒªãƒ³ã‚¯
Caffeã«ã‚ˆã‚‹ç‰¹å¾´æŠ½å‡º+AROWã«ã‚ˆã‚‹åˆ†é¡žã‚’è©¦ã—ãŸ - kivantiumæ´»å‹•æ—¥è¨˜
Deep Learningã®ã™ã”ã„ã¨ã“ã‚ã¨ã—ã¦ã‚ˆãæŒ™ã’ã‚‰ã‚Œã‚‹ã®ã¯ã€Œç”»åƒã‹ã‚‰è‡ªå‹•ã§ç‰¹å¾´æŠ½å‡ºã‚’ã—ã¦ãã‚Œã‚‹ã€ã“ã¨ã§ã™ã€‚å¾“æ¥ã®æ‰‹æ³•ã§ã‚ã‚Œã°ã‚¿ã‚¹ã‚¯ã«åˆã‚ã›ãŸç”»åƒã®ç‰¹å¾´ã‚’ã†ã¾ãæŠœãå‡ºã™ã‚ˆã†ãªç‰¹å¾´é‡ã‚’ä½œã‚‹å¿…è¦ãŒã‚ã‚Šã¾ã—ãŸãŒã€Deep Learningã§ã¯ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ãŒå‹æ‰‹ã«ã€Œç‰¹å¾´ã€ã‚’æŠ½å‡ºã—ã¦ãã‚Œã¾ã™ã€‚ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ãŒæŠ½å‡ºã—ãŸç‰¹å¾´é‡ã‚’ä½¿ã£ã¦åˆ¥ã®åˆ†é¡žå™¨ã‚’å¦ç¿’ã•ã›ã¦åˆ†é¡žã™ã‚‹ã“ã¨ã‚‚ã§ãã¾ã™ã€‚Deep LearningãŒè‡ªå‹•ã§ä½œã£ãŸç‰¹å¾´é‡ã‚’ä½¿ã†ã“ã¨ã§äººé–“ãŒä½œã£ãŸSIFTãªã©ã®ç‰¹å¾´é‡ã‚ˆã‚Šã‚‚é«˜ã„ç²¾åº¦ã§åˆ†é¡žãŒå¯èƒ½ã«ãªã‚‹ã“ã¨ã‚‚ã‚ã‚‹ã‚ˆã†ã§ã™ã€‚ ãã“ã§ä»Šå›žã¯Deep Learningãƒ©ã‚¤ãƒ–ãƒ©ãƒªã®Caffeã‚’ä½¿ã£ã¦ç‰¹å¾´æŠ½å‡ºã‚’è¡Œã£ãŸå¾Œã€AROWã¨ã„ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ä½¿ã£ã¦åˆ†é¡žã‚’è¡Œã£ã¦ã¿ãŸã„ã¨æ€ã„ã¾ã™ã€‚ Caffeã«ã‚ˆã‚‹ç‰¹å¾´æŠ½å‡º Caffe | Feature extraction with Caffe C++ code.ã¨Caffe
Hash 2015/06/28
Deep Learning Library "Caffe"

python

image

algorithm

C++
ãƒªãƒ³ã‚¯
è¨ˆç®—é‡ã®ã¯ãªã— - èµ¤ã„é»’æ´å²ã‚’è“„ç©ã™ã‚‹
ã©ã†ã‚‚è¯éº—ãªã‚‹ã‚ãƒ£ãƒƒãƒ„ãƒ‘ãƒ¼ã§ã™ã€‚ã‚ãƒ£ãƒƒãƒˆã‚¢ãƒƒãƒ‘ãƒ¼ã§ã™ã€‚ ã“ã®è¨˜äº‹ã¯Competitive Programming Advent Calendar Div2013, 12/7ã®è¨˜äº‹ã§ã™ã€‚ ç§ã¯éŽåŽ»ã«ã€æš‡ã«ä»»ã›ã¦ã“ã®ã‚ˆã†ãªã‚¹ãƒ©ã‚¤ãƒ‰ã‚’ä½œã£ã¦ã—ã¾ã„ã¾ã—ãŸã€‚ æœ‰åã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ãã‚Œã®è¨ˆç®—é‡ã«ã¤ã„ã¦åˆ—æŒ™ã™ã‚‹ã®ãŒæ¥½ã—ã™ãŽã¦ä½œã£ã¦ã—ã¾ã„ã¾ã—ãŸã€‚å¾Œæ‚”ã—ã¦ãŠã‚Šã¾ã™ã€‚ æœ¬è¨˜äº‹ã§ã¯ã€Œè¨ˆç®—é‡ã£ã¦ã©ã†ã‚„ã£ã¦è¨ˆç®—ã™ã‚‹ã®ï¼Ÿã€ã¿ãŸã„ãªè©±ã‚’ç«¶ãƒ—ãƒã®è¦³ç‚¹ã‹ã‚‰ã—ã¾ã™ã€‚ è¨ˆç®—é‡ã¨ã¯ãªã‚“ãžã‚„ã¨ã„ã†ã“ã¨ã«ã¤ã„ã¦ã¯ä¸Šã®ã‚¹ãƒ©ã‚¤ãƒ‰ã‚’èªã‚“ã§ãã ã•ã„ã€‚ è¨ˆç®—é‡ã®ç¨®é¡ž ç«¶æŠ€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§æ°—ã«ã™ã‚‹è¨ˆç®—é‡ã¯2ç¨®é¡žã‚ã‚Šã¾ã™ã€‚æœ€æ‚ªè¨ˆç®—é‡ã¨å„Ÿå´è¨ˆç®—é‡ã§ã™ã€‚ æœ€æ‚ªè¨ˆç®—é‡ã¨ã„ã†ã®ã¯ã€ã‚ã‚‹å‡¦ç†ã«ã©ã®ã‚ˆã†ãªå…¥åŠ›ã‚’ä¸Žãˆã¦ã‚‚ã€ãã‚Œä»¥ä¸Šã«é€Ÿã„è¨ˆç®—é‡ã«ãªã‚‹ã€ã¨ã„ã†ã‚‚ã®ã§ã€ä¸€ç¨®ã®ä¸Šç•Œã§ã™ã€‚ç«¶æŠ€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã¯ä½œå•è€…ãŒæœ€æ‚ªè¨ˆç®—é‡ã«ãªã‚‹ãƒ†ã‚¹ãƒˆã‚±ãƒ¼ã‚¹ã‚’ã‹ãªã‚‰ãšå…¥ã‚Œã¦ãã¾ã™ã‹ã‚‰
Hash 2015/02/24
algorithm

programming
ãƒªãƒ³ã‚¯
Heuristic (computer science) - Wikipedia
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources:Â "Heuristic"Â computer scienceÂ â€“Â newsÂ Â· newspapersÂ Â· booksÂ Â· scholarÂ Â· JSTOR (November 2025) (Learn how and when to remove this message) In mathematical optimization and computer science, heuristic (from Gr
Hash 2015/02/15
algorithm

wikipedia

programming
ãƒªãƒ³ã‚¯
Donutsãƒ—ãƒã‚³ãƒ³ãƒãƒ£ãƒ¬ãƒ³ã‚¸ 2015 è§£èª¬
2015/02/11 19:00ã€œ20:30 ã«é–‹å‚¬ã•ã‚ŒãŸ Donutsãƒ—ãƒã‚³ãƒ³ãƒãƒ£ãƒ¬ãƒ³ã‚¸ 2015 ã®è§£èª¬ã§ã™ã€‚ http://donuts-2015.contest.atcoder.jp/
Hash 2015/02/11
"ï¼ˆå®šçŸ³ï¼‰2é€²æ•°ã§ç®¡ç†" ã‚ãƒ¼...

AtCoder

algorithm

presentation

programming
ãƒªãƒ³ã‚¯
Rosetta Code
Rosetta Code is a programming chrestomathy site. The idea is to present solutions to the same task in as many different languages as possible, to demonstrate how languages are similar and different, and to aid a person with a grounding in one approach to a probl em in learning another. Rosetta Code currently has 1,338 tasks, 398 draft tasks, and is aware of 982 languages, though we do not (and cann
Hash 2015/02/11
programming

wiki

algorithm
ãƒªãƒ³ã‚¯
Knuth-Morris-Pratt algorithm
Idea After a shift of the pattern, the naive algorithm has forgotten all information about previously matched symbols. So it is possible that it re-compares a text symbol with different pattern symbols again and again. This leads to its worst case complexity of Î˜(nm) (n: length of the text, m: length of the pattern). The algorithm of Knuth, Morris and Pratt [KMP 77] makes use of the information ga
Hash 2015/02/10
algorithm
ãƒªãƒ³ã‚¯
Big O notation - Wikipedia
Big O notation is a mathematical notation that describes the approximate size of a function on a domain. Big O is a member of a family of notations invented by German mathematicians Paul Bachmann and [1] Edmund Landau [2] and expanded by others, collectively called Bachmannâ€“Landau notation. The letter O was chosen by Bachmann to stand for Ordnung, meaning the order of approximation. In computer sc
Hash 2015/01/28
Oè¨˜æ³•ã®"="ç”¨æ³•ã«ã¤ã„ã¦è©³ã—ãæ›¸ã‹ã‚Œã¦ã‚‹

algorithm

computer

wikipedia
ãƒªãƒ³ã‚¯
Informatik - UniversitÃ¤t Ulm
FakultÃ¤t FakultÃ¤t FakultÃ¤t FakultÃ¤t - Organisation FakultÃ¤t - Organisation FakultÃ¤tsrat PrÃ¼fungsausschÃ¼sse PrÃ¼fungsausschÃ¼sse PA Informatik EB CogSys PrÃ¼fungsausschuss ING PrÃ¼fungsausschuss Psychologie Studienkommissionen PromotionsausschÃ¼sse Habilitationsausschuss ZulassungsausschÃ¼sse Ethik Gremium Gleichstellungsbeauftragte Mitgliedschaften Formulare Aktuelles Aktuelles Stellenangebote Sitzungen
Hash 2015/01/25
1996-2009

programming

algorithm
ãƒªãƒ³ã‚¯
æ–‡å—åˆ—æ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®è¦šãˆæ›¸ã - æˆ‘ã‚‰ãã¶ãŸé¦¬é¹¿
ãƒžã‚¤ã‚³ãƒŸã‚¸ãƒ£ãƒ¼ãƒŠãƒ«ã®é€£è¼‰è¨˜äº‹ã§ã€ã€ŒStringSearchã€ã¨ã„ã†æ–‡å—åˆ—æ¤œç´¢ã®ãŸã‚ã®Javaãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’ç´¹ä»‹ã—ã¾ã—ãŸã€‚ æ”»ç•¥! ãƒ„ãƒ¼ãƒ«ãƒ»ãƒ‰ãƒ»ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° (44) é«˜é€Ÿãªæ–‡å—åˆ—æ¤œç´¢ã‚’å®Ÿç¾ã™ã‚‹Javaãƒ©ã‚¤ãƒ–ãƒ©ãƒªã€ŒStringSearchã€ | ãƒžã‚¤ãƒŠãƒ“ãƒ‹ãƒ¥ãƒ¼ã‚¹ ãã®è£œè¶³ã‚‚å…¼ãã¦ã€è¨˜äº‹ä¸ã«å‡ºã¦ãã‚‹æ–‡å—åˆ—æ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦å°‘ã—ã¾ã¨ã‚ã¦ã¿ã¾ã—ãŸã€‚ç´°éƒ¨ã‚’çœç•¥ã—ãŸå¤§é›‘æŠŠãªèª¬æ˜Žãªã®ã§åŽ³å¯†ãªè§£èª¬ã§ã¯ã‚ã‚Šã¾ã›ã‚“ãŒã€å‚è€ƒã¾ã§ã«ã€‚ naiveã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å¯¾è±¡ã®æ–‡å—åˆ—ã¨ãƒ‘ã‚¿ãƒ¼ãƒ³æ–‡å—åˆ—ã‚’å…ˆé ã‹ã‚‰é †ç•ªã«æ¯”ã¹ã¦ã„ãã€ãƒžãƒƒãƒã—ãªã‹ã£ãŸã‚‰1æ–‡å—é€²ã‚ã¦ã¾ãŸæœ€åˆã‹ã‚‰æ¯”ã¹ã‚‹ã¨ã„ã†æ‰‹æ³•ã§ã™ã€‚ java.lang.Stringã®indexOf()ãƒ¡ã‚½ãƒƒãƒ‰ãªã©ã¯ã“ã®å®Ÿè£…ã ãã†ã§ã™ã€‚ Knuth Morris Pattã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼ˆKMPã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼‰ ãƒžãƒƒãƒã«å¤±æ•—ã—ãŸå ´åˆã«ã€æ¯”è¼ƒã™ã‚‹ã‚¹ã‚¿ãƒ¼ãƒˆä½ç½®ã‚’1æ–‡å—ãšã¤é€²ã‚ã‚‹ã§ã¯ãªãã€ä½•
Hash 2015/01/25
algorithm
ãƒªãƒ³ã‚¯
1 2 3 4 5 6 7 8 9 æ¬¡ã®ãƒšãƒ¼ã‚¸