{"version":"1.0","provider_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","provider_url":"https:\/\/fatihsoysal.com\/blog","author_name":"Fatih Soysal","author_url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/","title":"Alice ve Bob'un Bulu\u015fabilece\u011fi Bina: Bir Algoritma Maceras\u0131","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"QJ0ujooTYS\"><a href=\"https:\/\/fatihsoysal.com\/blog\/alice-ve-bobun-bulusabilecegi-bina-bir-algoritma-macerasi\/\">Alice ve Bob&#8217;un Bulu\u015fabilece\u011fi Bina: Bir Algoritma Maceras\u0131<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/fatihsoysal.com\/blog\/alice-ve-bobun-bulusabilecegi-bina-bir-algoritma-macerasi\/embed\/#?secret=QJ0ujooTYS\" width=\"600\" height=\"338\" title=\"&#8220;Alice ve Bob&#8217;un Bulu\u015fabilece\u011fi Bina: Bir Algoritma Maceras\u0131&#8221; &#8212; Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" data-secret=\"QJ0ujooTYS\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n<\/script>\n","description":"Bilgisayar bilimlerinde s\u0131k\u00e7a kar\u015f\u0131la\u015ft\u0131\u011f\u0131m\u0131z bir problem t\u00fcr\u00fc, optimum \u00e7\u00f6z\u00fcmler bulmay\u0131 gerektiren optimizasyon problemleridir. Bu problemlerden biri de, Alice ve Bob gibi iki ki\u015finin, aralar\u0131ndaki mesafenin minimum oldu\u011fu bir bulu\u015fma noktas\u0131 bulma problemi. Bu makalede, Alice ve Bob'un her ikisinin de kolayca ula\u015fabilece\u011fi bir bina bulmak i\u00e7in kullanabilece\u011fimiz etkili bir algoritmay\u0131 inceleyece\u011fiz. \u00d6ncelikle, problemi daha iyi anlamak i\u00e7in sorunu basit\u00e7e ifade edelim: Alice ve Bob'un her biri, belirli bir bina k\u00fcmesinde bulunuyor ve bu binalar aras\u0131nda belirli mesafeler var. Hedefimiz, Alice ve Bob'un her ikisine de en yak\u0131n olan binay\u0131 bulmakt\u0131r. Bu problemin \u00e7\u00f6z\u00fcm\u00fcnde etkili bir strateji benimsemek \u00f6nemlidir."}