808 research outputs found
Müzakere tabanlı dağıtık anlaşmazlık çözümleme ile çoklu etmenli sistemlerde yol bulma
No full textThis thesis addresses the problem of Multi-Agent Path Finding problem where multiple agents aim to reach their destination in a grid world without any colli sion. It aims to provide a solution achieving good trade-off between the privacy of the agents and the effectiveness of solutions. Accordingly, a token-based bilateral negotiation approach is presented to solve this problem in a distributed way. The proposed approach is evaluated empirically in various scenarios by comparing it with state-of-the-art centralized approaches such as Conflict Based Search and its variants. The experimental results showed that the proposed approach can find conflict-free path solutions albeit suboptimally, especially when the search space is large and high-density, whereas centralized approaches struggle to find optimal solutions. Despite being outperformed by suboptimal centralized solvers, the pro posed decentralized approach can achieve considerable results with naive agents by sharing minimal information about themselves. The proposed approach also enables agents to have their autonomy; thus, the proposed approach is convenient for MAPF problems involving self-interested agents.Bu tez, coklu etmenli sistemlerde yol planlamas problemine, muzakere yontemi tabanl bir yakla s m geli stirmeyi hede iyor. Bu yakla s mda, sistemdeki etkenlerin verilerinin gizlili gi ve cozumlerin efekti i gi aras nda kayda de ger bir denge kurulmas ama clanm st r. Bunun i cin, jeton tabanl ikili muzakere protokolu ve bu protokol ile uyumlu muzakere stratejileri sunulmaktad r. Onerilen yakla s m, ce sitli senaryolarda, C ak sma Tabanl Arama (CBS) ve benzer geli smi s merkezi sonu c uretme cozumlerine kar s sonu clar de gerlendirilmi stir. Deney sonu clar nda sunulan da g t k sorun cozme yakla s m n n merkezil cozum yakla s mlar na kar s n kayda de ger sonu clar uretebildi gini gostermektedir. Onerilen yakla s m, sistem etmenlerinin kendi karar vermelerini sa glamaktad r. Bu sebepten oturu, bu yakla s m, bireyselli gini gerektiren durumlar i cin idealdir
Decentralized multi-agent path finding framework and strategies based on automated negotiation
No full textThis paper introduces a negotiation framework to solve the Multi-Agent Path Finding (MAPF) Problem for self-interested agents in a decentralized fashion. The framework aims to achieve a good trade-off between the privacy of the agents and the effectiveness of solutions. Accordingly, a token-based bilateral negotiation protocol and two negotiation strategies are presented. The experimental results over four different settings of the MAPF problem show that the proposed approach could find conflict-free path solutions albeit suboptimally, especially when the search space is large and high-density. In contrast, Explicit Estimation Conflict-Based Search (EECBS) struggles to find optimal solutions. Besides, deploying a sophisticated negotiation strategy that utilizes information about local density for generating alternative paths can yield remarkably better solution performance in this negotiation framework.Interactive Intelligenc
A Decentralized Token-Based Negotiation Approach for Multi-Agent Path Finding
No full textThis paper introduces a negotiation approach to solve the Multi-Agent Path Finding problem. The approach aims to achieve a good trade-off between the privacy of the agents and the effectiveness of solutions. Accordingly, a token-based bilateral negotiation protocol and a compatible negotiation strategy are presented. The proposed approach is evaluated in a variety of scenarios by comparing it with state-of-the-art centralized approaches such as Conflict Based Search and its variant. The experimental results showed that the proposed approach can find conflict-free path solutions with a higher success rate, especially when the search space is large and high-density compared to centralized approaches while the gap between path cost differences is reasonably low. The proposed approach enables agents to have their autonomy; thus, it is convenient for MAPF problems involving self-interested agents
OB00090 - Eran Stone Boar
No full text<a class="mw-redirect" href="https://en.wikipedia.org/wiki/Eran,_India" title="">Eran, Madhya Pradesh</a>.
<a href="https://upload.wikimedia.org/wikipedia/commons/1/10/5th_century_Varaha_boar_statue_with_goddess_earth_hanging%2C_sages_and_saints_reliefs_on_its_body.jpg"></a>
Stone Boar, inscribed with a record of Toramāṇa
MedSpecSearch: Medical specialty search
No full textMedSpecSearch (www.medspecsearch.com) is a search engine for helping users to find the relevant medical specialty for a doctor visit based on users’ description of symptoms. This system is useful for users who are not sure of which medical specialty they should consult to. Furthermore, the API of the search engine can be used as part of the online doctor appointment and medical consultation sites to route the patient or question to the right medical specialty. The system returns the top three relevant specialties when the estimated confidence score is high. Otherwise, it asks users to input more data.Türk Telekom R&D Center
OB00045 - Eran Pillar of Goparāja
No full textEran, Madhya Pradesh.
Hero-stone of Goparāja, mentioning Bhānugupta and located near the hamlet of Pahlejpur
Relationships between mobile phone usage and activity-travel behavior: A review of the literature and an example
No full textAlmost everyone has a mobile phone today. In addition to calls and text messages, people are utilizing mobile apps and websites to connect to the world and explore different content anytime and anywhere. The use of smart phones generates billions of records, including spatiotemporal trajectories, and various mobile phone usage details, such as call duration, and frequency of visiting a certain type of website. Most transportation researchers have only focused on spatiotemporal traces, which represent activity-travel behavior of users. However, it is worth making full use of smart phone data to study how mobile phone usage is related to activity-travel behavior. This chapter first reviews the existing literature on the relevant topics to demonstrate the lack of research on the relationship between mobile internet usage and activity-travel behavior. Based on an 11-day dataset from Shanghai that includes not only spatiotemporal traces but also the frequencies of browsing different categories of mobile internet content (e.g., tourism and finance), we examine several relationships between mobile internet usage and activity-travel behavior.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Transport and Plannin
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits
No full textsponsorship: This work has been supported in part by ERC Advanced Grant ERC-2015-AdG-IMPaCT, by the Defense Advanced Research Projects Agency (DARPA) and Space and Naval Warfare Systems Center, Pacific (SSC Pacific) under contract No. N66001-15-C-4070, FA8750-19-C-0502 and HR001120C0085, by the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA) via Contract No. 2019-1902070006, by the FWO under an Odysseus project GOH9718N, and by CyberSecurity Research Flanders with reference number VR20192203. Eduardo Soria-Vazquez was supported by the Carlsberg Foundation under the Semper Ardens Research Project CF18-112 (BCM). Aner BenEfraim and Eran Omri were supported by ISF grant 152/17, and by the Ariel Cyber Innovation Center in conjunction with the Israel National Cyber directorate in the Prime Minister's Office. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of any of the funders. The U.S. Government is authorized to reproduce and distribute reprints for governmental purposes notwithstanding any copyright annotation therein. (ERC, Defense Advanced Research Projects Agency (DARPA), Space and Naval Warfare Systems Center, Pacific (SSC Pacific)|N66001-15-C-4070, Space and Naval Warfare Systems Center, Pacific (SSC Pacific)|FA8750-19-C-0502, Space and Naval Warfare Systems Center, Pacific (SSC Pacific)|HR001120C0085, Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA)|2019-1902070006, FWO under an Odysseus project|GOH9718N, CyberSecurity Research Flanders|VR20192203, Carlsberg Foundation under the Semper Ardens Research Project|CF18-112, ISF grant|152/17, Ariel Cyber Innovation Center, Israel National Cyber directorate in the Prime Minister's Office)status: Publishe
Collective Action in Plant Breeding
No full textOlson (1965) formulated a "Logic of Collective Action". We investigate whether a logic of collective action in plant breeding - and research and development generally - can be constructed. Using a case study on the Latin American Fund for Irrigated Rice (FLAR) as well as other real-world institutions of collective action in R&D, we construct an expanded logic of collective action, which revolves around two core features: Impure public goods and the tragedy of the anticommons. Provisions of FLAR and other institutions are related to game theory and contract theory, and theoretical, methodological and policy implications are outlined.Institutional and Behavioral Economics,
- …
