{"id":207,"date":"2006-07-06T19:14:58","date_gmt":"2006-07-07T01:14:58","guid":{"rendered":"http:\/\/hunch.net\/?p=207"},"modified":"2006-07-06T19:14:58","modified_gmt":"2006-07-07T01:14:58","slug":"branch-prediction-competition","status":"publish","type":"post","link":"https:\/\/hunch.net\/?p=207","title":{"rendered":"Branch Prediction Competition"},"content":{"rendered":"<p><a href=\"http:\/\/web.engr.oregonstate.edu\/~afern\/\">Alan Fern<\/a> points out the <a href=\"http:\/\/camino.rutgers.edu\/cbp2\/\">second branch prediction challenge<\/a> (due September 29) which is a follow up to the <a href=\"http:\/\/www.jilp.org\/cbp\/\">first branch prediction competition<\/a>.  Branch prediction is one of the fundamental learning problems of the computer age: without it our computers might run an order of magnitude slower.  This is a tough problem since there are sharp constraints on time and space complexity in an online environment.  For machine learning, the &#8220;idealistic track&#8221; may fit well.  Essentially, they remove these constraints to gain a weak upper bound on what might be done.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Alan Fern points out the second branch prediction challenge (due September 29) which is a follow up to the first branch prediction competition. Branch prediction is one of the fundamental learning problems of the computer age: without it our computers might run an order of magnitude slower. This is a tough problem since there are &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/hunch.net\/?p=207\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Branch Prediction Competition&#8221;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31,29],"tags":[],"class_list":["post-207","post","type-post","status-publish","format-standard","hentry","category-competitions","category-machine-learning"],"_links":{"self":[{"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/posts\/207","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=207"}],"version-history":[{"count":0,"href":"https:\/\/hunch.net\/index.php?rest_route=\/wp\/v2\/posts\/207\/revisions"}],"wp:attachment":[{"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=207"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=207"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hunch.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=207"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}