Sökning: "Imperfect Information"

Visar resultat 1 - 5 av 84 uppsatser innehållade orden Imperfect Information.

  1. 1. Multicriteria Evaluation in Real Estate Land-use Suitability Analysis: The case of Volos, Greece

    Master-uppsats, Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskap

    Författare :Panagiotis Dimitrios Tsachageas; [2024]
    Nyckelord :Geography; GIS; Real Estate; Multicriteria Evaluation; Fuzzy; AHP; Earth and Environmental Sciences;

    Sammanfattning : The integration of Geographic Information Systems (GIS) into real estate analysis has long been considered an interesting interdisciplinary pursuit, but has yet to become mainstream. Despite the increasing academic focus over the last twenty years, this endeavour has mostly been approached from the scientific side of Geography. LÄS MER

  2. 2. Mind The Gap Between Your Intelligence And Choice Architecture

    Master-uppsats, Göteborgs universitet/Graduate School

    Författare :Amanda Liljevall; Emelie Lillskog; [2023-07-03]
    Nyckelord :Cookie consent notices; cookie banner; choice architecture; consumer choice behaviour; general data protection regulation; GDPR; online privacy; web content analysis;

    Sammanfattning : Digital footprints of online behaviour are now possible to gather through the use of cookies. As a result, consumer activities once considered private are now monitored and used by online businesses and marketers, providing them with information about who we are, what we think, and what we like. LÄS MER

  3. 3. Reinforcement Learning for Multi-Agent Strategy Synthesis Using Higher-Order Knowledge

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Gustav Forsell; Shamoun Gergi; [2023]
    Nyckelord :Higher Order Knowledge; Imperfect Information; Reinforcement Learning; Deep Q- networks; Knowledge Representation; Pursuit Evasion Games;

    Sammanfattning : Imagine for a moment we are living in the distant future where autonomous robots are patrollingthe streets as police officers. Two such robots are chasing a robber through the city streets. Fearingthe thief might listen in to any potential transmission, both robots remain radio silent and are thuslimited to a strictly visual pursuit. LÄS MER

  4. 4. Multiple-Emitter Super-resolution Imaging using the Alternating Descent Conditional Gradient Method

    Kandidat-uppsats, Lunds universitet/Beräkningsbiologi och biologisk fysik - Genomgår omorganisation; Lunds universitet/Institutionen för astronomi och teoretisk fysik - Genomgår omorganisation

    Författare :Dolev Illouz; [2023]
    Nyckelord :super-resolution; alternating descent conditional gradient method; ADCG; multiple-emitter localization; nanoscale imaging; single molecule tracking; Physics and Astronomy;

    Sammanfattning : This thesis examines the state-of-the-art 2D super-resolution technique alternating descent conditional gradient (ADCG) method's ability to accurately localize fluorophores in diffraction-limited single molecule images (SMI) and analyze the impact of pre-processing and post-processing modules on ADCG's fluorophore localization. A synthetic dataset obtained from the 2013 Grand Challenge localization microscopy and a temporally linked dataset obtained from an unpublished set of Optical DNA mapping experiments performed by Jonathan Jeffet at the NanoBioPhotonix Lab at Tel-Aviv University were initially segmented to extract their noise parameters. LÄS MER

  5. 5. On the strategic abilities gained by using knowledge-based strategies for multi-agent teams playing against nature

    Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Sam Maltin; Simon Rosén; [2023]
    Nyckelord :;

    Sammanfattning : Analogous to how the Knowledge-Based Subset Construct (KBSC) can transform games of imperfect information against nature into games of perfect information, making it easier to find winning strategies for objectives in these games, the multi-agent knowledge-based subset construct (MKBSC) can be used to find winning strategies in multi-agent games of imperfect information. The difference between the two algorithms is that the generalized version can be applied multiple times, which is interpreted as the agent’s considering not just their own knowledge of the game, but also their knowledge of the other agents, and the knowledge of the other agent’s knowledge about their own knowledge, etc. LÄS MER