å½éå¦ä¼ ALENEX 2014 ã«è«æãæ¡æããã¾ããï¼ALENEX (Meeting on Algorithm Engineering & Experiments) 㯠SIAM ã«ãã£ã¦éå¬ãããå®é¨ç³»ã¢ã«ã´ãªãºã (experimental algorithmics) ãæ±ãæãæåãªä¼è°ã® 1 ã¤ã§ï¼çè«ç³»ã¢ã«ã´ãªãºã ã®ãããå¦ä¼ SODA (Symposium on Discrete Algorithms) ã«ä½µè¨ãã¦éå¬ããã¾ãï¼çºè¡¨ã¯æ¥å¹´ã® 1 æã«ã¢ã¡ãªã«ã®ãªã¬ã´ã³ã§ãï¼ ä»åã®è«æã¯ "Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling" ã¨ããã¿ã¤ãã«ã§ï¼ç 究室ã®å¾è¼©ã®æ²³ç°åï¼åæã®å²©ç°ï¼NII ã®æ²³åæå çã¨ã®å ±èã§ãï¼ã¿ã¤ãã«ãããå¯ãã®éãï¼SIGMOD'

{{#tags}}- {{label}}
{{/tags}}