Literatura académica sobre el tema "Perfect information"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Perfect information".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Perfect information"
King, Stephen P. "Is perfect information perfectly useless?" Economics Letters 39, n.º 4 (agosto de 1992): 415–18. http://dx.doi.org/10.1016/0165-1765(92)90178-2.
Texto completoDowden, John S. "Product information past perfect". Medical Journal of Australia 186, n.º 2 (enero de 2007): 51–52. http://dx.doi.org/10.5694/j.1326-5377.2007.tb00797.x.
Texto completoDubey, Pradeep y Ori Haimanko. "Learning with perfect information". Games and Economic Behavior 46, n.º 2 (febrero de 2004): 304–24. http://dx.doi.org/10.1016/s0899-8256(03)00127-1.
Texto completoLapidoth, A. y S. Shamai. "Fading channels: how perfect need "perfect side information" be?" IEEE Transactions on Information Theory 48, n.º 5 (mayo de 2002): 1118–34. http://dx.doi.org/10.1109/18.995552.
Texto completoBondar, Vladimir. "The present perfect in past time contexts : a diachronic study of English". Brno studies in English, n.º 2 (2023): 5–29. http://dx.doi.org/10.5817/bse2023-2-1.
Texto completoKukushkin, Nikolai S. "Perfect Information and Potential Games". Games and Economic Behavior 38, n.º 2 (febrero de 2002): 306–17. http://dx.doi.org/10.1006/game.2001.0859.
Texto completoFlesch, János y Arkadi Predtetchinski. "Parameterized games of perfect information". Annals of Operations Research 287, n.º 2 (28 de octubre de 2018): 683–99. http://dx.doi.org/10.1007/s10479-018-3087-5.
Texto completoHe, Wei y Yeneng Sun. "Dynamic games with (almost) perfect information". Theoretical Economics 15, n.º 2 (2020): 811–59. http://dx.doi.org/10.3982/te2927.
Texto completoDatta, Pratim, Mark Whitmore y Joseph K. Nwankpa. "A Perfect Storm". Digital Threats: Research and Practice 2, n.º 2 (abril de 2021): 1–21. http://dx.doi.org/10.1145/3428157.
Texto completoHarris, Christopher. "Existence and Characterization of Perfect Equilibrium in Games of Perfect Information". Econometrica 53, n.º 3 (mayo de 1985): 613. http://dx.doi.org/10.2307/1911658.
Texto completoTesis sobre el tema "Perfect information"
Hummelgren, Lars y Anton Lyxell. "Using PAQ8L to play games of perfect information". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229759.
Texto completoEn av de bästa kompressionsalgoritmerna idag med hänsyn till kompressionsgrad är PAQ8L. Den här avhandlingen visar hur PAQ8L kan användas för att förutsäga drag i en fyra gånger fyra variant av luffarschack.Vi definierar tre agenter för att utvärdera PAQ8L. Den första agenten är baserad på memorering, den andra gör slumpmässiga gissningar och den tredje använder PAQ8L för att förutsäga drag. Precisionen hos agenten baserad på PAQ8L överträffar precisionen hos de övriga agenterna. Däremot använder den betydligt mer tid och minne.
Hidalgo, Dario. "Value of perfect information of transportation forecasting models /". The Ohio State University, 1997. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487943341526861.
Texto completoKelmendi, Edon. "Two-Player Stochastic Games with Perfect and Zero Information". Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0238/document.
Texto completoWe consider stochastic games that are played on finite graphs. The subject of the first part are two-player stochastic games with perfect information. In such games the two players take turns choosing actions from a finite set, for an infinite duration, resulting in an infinite play. The objective of the game is given by a Borel-measurable and bounded payoff function that maps infinite plays to real numbers. The first player wants to maximize the expected payoff, and the second player has the opposite objective, that of minimizing the expected payoff. We prove that if the payoff function is both shift-invariant and submixing then the game is half-positional. This means that the first player has an optimal strategy that is at the same time pure and memoryless. Both players have perfect information, so the actions are chosen based on the whole history. In the second part we study finite-duration games where the protagonist player has zero information. That is, he gets no feedback from the game and consequently his strategy is a finite word over the set of actions. Probabilistic finite automata can be seen as an example of such a game that has only a single player. First we compare two classes of probabilistic automata: leaktight automata and simple automata, for which the value 1 problem is known to be decidable. We prove that simple automata are a strict subset of leaktight automata. Then we consider half-blind games, which are two player games where the maximizer has zero information and the minimizer is perfectly informed. We define the class of leaktight half-blind games and prove that it has a decidable maxmin reachability problem
Matras, Omolara. "In pursuit of a perfect system : Balancing usability and security in computer system development". Thesis, Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-123737.
Texto completoVårt samhälle är beroende av information och olika tekniker och artefakter som ger oss tillgång till den. Men tekniken vi förlitar oss på i olika aspekter av våra liv är ofullkomliga och under det senaste decenniet, har dessa brister varit föremål för identitetstjuvar, cyberbrottslingar och illvilliga personer inom och utanför organisationen. Dessa illvilliga personer riktar ofta sig till nätverk av organisationer såsom sjukhus, banker och andra finansiella organisationer. Tillgång till dessa nätverk uppnås genom att kringgå säkerhetsmekanismer av datorsystem anslutna till organisationens nätverk. Målet med datorsystemsäkerhet är att förhindra eller upptäcka hot; eller återhämta sig från eventuella attacker. Trots stora investeringar i IT-säkerhet infrastruktur och informationssäkerhet, över 95 % av banker, sjukhus och myndigheter har minst 10 skadliga infektioner kringgå befintliga säkerhetsmekanismer och träda in i sitt nätverk utan att upptäckas. Detta har lett till förlust av värdefulla informationer och stora summor av pengar från banker och andra organisationer över hela världen. Från tidigare forskning inom detta område, har det visat sig att anledningen till att säkerhetsmekanismer misslyckas beror ofta på att den används på ett felaktigt sätt eller används inte alls. I synnerhet menar de flesta användare att säkerhetsmekanismer på sina datorer är alltför komplicerat. Därför har tidigare forskning fokuserat på att göra datorsystemsäkerhet användbar så att den är "mindre komplicerat" för alla typer av användare, i stället för att designa datorer som både är användbara och säkra. Problemet med detta traditionella synsätt är att säkerheten behandlas som ett "tillägg" till en färdig datorsystemdesign. Denna studie är ett försök att ändra det traditionella synsättet genom att justera två faser av en datorsystemdesign modell för att integrera insamlingen av användbarhets- samt säkerhetskrav. Styrd av den explorativ fallstudie forskningsdesignen, fick jag nya insikter i en situation som har gäckat säkerhetsspecialister och organisatoriska aktörer. Denna studie resulterade i skapande av en designmetodik för användbara och säkra datorsystem. Även om denna metod är ännu i sin rudimentära fas, testades den med hjälp av en webbenkät. Data från litteraturstudien sorterades med hjälp av en syntesmatris; och analyserades med kvalitativ innehållsanalys. Några framstående design- och säkerhetsmodeller samt metoder som diskuterades i denna uppsats inkludera Användarcentrerad System Design (UCSD), Ändamålsenligt och Effektivt Vägledning för Informationssäkerhet (AEGIS) och Octave Allegro.
Karlsson, Ann Johansson Susanne. "Den perfekta informationsspridaren? : en komparativ studie av tre organisationers intranätanvändning = [The perfect way to spread information?] : [a comparative study of the use of intranet in three organizations] /". Borås : Högsk. i Borås, Bibliotekshögskolan/Biblioteks- och informationsvetenskap, 2004. http://www.hb.se/bhs/slutversioner/2004/04-08.pdf.
Texto completoCapser, Shawn Patrick Capser. "Assessing the Value of Information for ComparingMultiple, Dependent Design Alternatives". University of Toledo / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1520689318651851.
Texto completoÖberg, Viktor. "EVOLUTIONARY AI IN BOARD GAMES : An evaluation of the performance of an evolutionary algorithm in two perfect information board games with low branching factor". Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-11175.
Texto completoArjonilla, Jérôme. "Sampling-Based Search Algorithms in Games". Electronic Thesis or Diss., Université Paris sciences et lettres, 2024. http://www.theses.fr/2024UPSLD031.
Texto completoAlgorithm research in the context of games is a highly active field. Games are a prime application domain for search algorithms because they allow for the modeling and efficient resolution of complex problems. Many algorithms were first developed for games before being extended to other domains. In this thesis, we focus on heuristic search algorithms in the context of games, particularly heuristic search algorithms based on sampling, such as Monte Carlo Tree Search (MCTS) in perfect information, and based on determinization in imperfect information. We also explore the integration of search algorithms with other types of algorithms, especially reinforcement learning algorithms. We present existing methods as well as several original contributions in this field. The first part of the thesis is dedicated to the study of domain-independent heuristic search algorithms, making them easily testable and applicable in various contexts. Specifically, we focus on games with imperfect information, where players do not know all the details about the game state. In these types of algorithms and games, certain problems arise with existing methods, particularly issues related to strategy fusion and the impact of information revelation. We will discuss these problems in detail and present two original methods to address them. The second part of the thesis explores domain-dependent heuristic search algorithms. Domain-dependent algorithms are often more efficient than domain-independent ones because they can learn, generalize, and adapt to a specific domain. Throughout this part, we investigate the integration of heuristic search algorithms with other types of algorithms, particularly reinforcement learning algorithms. We present an original contribution in this area and another contribution that is currently under development. The first method proposes to enhance search algorithms by integrating reinforcement learning algorithms based on the guiding principle. The second method aims to incorporate model-based methods into searches in imperfect information settings
Corazza, Federico Augusto. "Analysis of graph-based quantum error-correcting codes". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23801/.
Texto completoLinnusaar, Marcus. "GDPR : Jakten på den "perfekta" lösningen". Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-18943.
Texto completoLibros sobre el tema "Perfect information"
Alpern, Steve. Cycles in extensive form perfect information games. London: Suntory-Toyota International Centre for Economics and Related Disciplines, 1989.
Buscar texto completoAghion, Philippe. Subgame perfect implementation with almost perfect information and the hold-up problem. Cambridge, MA: National Bureau of Economic Research, 2009.
Buscar texto completoArieli, Itai. Infinite sequential games with perfect but incomplete information. Jerusalem: The Hebrew University of Jerusalem, Center for the Study of Rationality, 2009.
Buscar texto completoCull, Paul. Perfect codes, NP-completeness, and towers of Hanoi graphs. Corvallis, OR: Oregon State University, Dept. of Computer Science, 1998.
Buscar texto completoCull, Paul. Perfect codes, NP-completeness, and towers of Hanoi graphs. Corvallis, OR: Oregon State University, Dept. of Computer Science, 1998.
Buscar texto completoCohen, Samuel y Steven Johnson. Future Perfect. Dreamscape Media Llc, 2012.
Buscar texto completoPerfect killer. New York: Forge, 2007.
Buscar texto completoPBLSHING, MNS. Nobody is perfect but if you are a Information Security Analyst you're pretty damn close: Information Security Analyst notebook , perfect gift for Information Security Analyst. Independently published, 2019.
Buscar texto completoMoskowitz, Ken, Dean Lane y Harris Kern. CIO Bundle: Perfect for Leaders in IT Vision and Strategy. Prentice Hall PTR, 2004.
Buscar texto completoLife, Happy. Life Organizer: Perfect Planner for All Important Life Information. Independently Published, 2019.
Buscar texto completoCapítulos de libros sobre el tema "Perfect information"
Mirman, Leonard J. "Perfect Information". En The New Palgrave Dictionary of Economics, 1–4. London: Palgrave Macmillan UK, 1987. http://dx.doi.org/10.1057/978-1-349-95121-5_1669-1.
Texto completoMirman, Leonard J. "Perfect Information". En The New Palgrave Dictionary of Economics, 1–4. London: Palgrave Macmillan UK, 2008. http://dx.doi.org/10.1057/978-1-349-95121-5_1669-2.
Texto completoMirman, Leonard J. "Perfect Information". En The New Palgrave Dictionary of Economics, 10193–96. London: Palgrave Macmillan UK, 2018. http://dx.doi.org/10.1057/978-1-349-95189-5_1669.
Texto completoMirman, Leonard J. "Perfect Information". En Game Theory, 194–98. London: Palgrave Macmillan UK, 1989. http://dx.doi.org/10.1007/978-1-349-20181-5_22.
Texto completoShaffer, David Williamson y Zhiqiang Cai. "Perfect Sampling". En Communications in Computer and Information Science, 40–57. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-76335-9_4.
Texto completoSusilo, Willy, Yi Mu y Fangguo Zhang. "Perfect Concurrent Signature Schemes". En Information and Communications Security, 14–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30191-2_2.
Texto completoSolov’eva, Faina I. "Switchings and Perfect Codes". En Numbers, Information and Complexity, 311–24. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-6048-4_25.
Texto completoTveit, Anders. "Practice makes perfect". En IFIP – The International Federation for Information Processing, 127–34. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-09729-9_18.
Texto completoZolfaghari, Behrouz y Khodakhast Bibak. "Information-Theoretic Cryptography and Perfect Secrecy". En Perfect Secrecy in IoT, 3–13. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13191-2_1.
Texto completoZielonka, Wiesław. "Perfect-Information Stochastic Parity Games". En Lecture Notes in Computer Science, 499–513. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24727-2_35.
Texto completoActas de conferencias sobre el tema "Perfect information"
Arjonilla, Jérôme, Abdallah Saffidine y Tristan Cazenave. "Perfect Information Monte Carlo with Postponing Reasoning". En 2024 IEEE Conference on Games (CoG), 1–8. IEEE, 2024. http://dx.doi.org/10.1109/cog60054.2024.10645574.
Texto completoKhalesi, Ali y Petros Elia. "Perfect Multi-User Distributed Computing". En 2024 IEEE International Symposium on Information Theory (ISIT), 1349–54. IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619542.
Texto completoDeng, Zirui, Vinayak Ramkumar y Netanel Raviv. "Perfect Subset Privacy in Polynomial Computation". En 2024 IEEE International Symposium on Information Theory (ISIT), 933–38. IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619107.
Texto completoZamani, Amirreza, Borja Rodríguez-Gálvez y Mikael Skoglund. "On Information Theoretic Fairness: Compressed Representations with Perfect Demographic Parity". En 2024 IEEE Information Theory Workshop (ITW), 25–30. IEEE, 2024. https://doi.org/10.1109/itw61385.2024.10807019.
Texto completoGautam, Abhiraj, Yogesh Lohumi y Durgaprasad Gangodkar. "Achieving Near-Perfect Accuracy in CIFAR-10 Classification". En 2024 Second International Conference on Advances in Information Technology (ICAIT), 1–6. IEEE, 2024. http://dx.doi.org/10.1109/icait61638.2024.10690610.
Texto completoNitinawarat, S. y P. Narayan. "Perfect omniscience, perfect secrecy and Steiner tree packing". En 2010 Information Theory and Applications Workshop (ITA). IEEE, 2010. http://dx.doi.org/10.1109/ita.2010.5454101.
Texto completoNair, Premchand S. "Perfect and precisely perfect fuzzy graphs". En NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society. IEEE, 2008. http://dx.doi.org/10.1109/nafips.2008.4531246.
Texto completoNitinawarat, S., A. Barg, P. Narayan, C. Ye y A. Reznik. "Perfect secrecy, perfect omniscience and steiner tree packing". En 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205948.
Texto completoBoztas, Serdar y Udaya Parampalli. "Nonbinary sequences with perfect and nearly perfect autocorrelations". En 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513729.
Texto completoMatsufuji, S., Y. Tanada, A. Fujimoto y N. Suehiro. "On perfect arrays". En IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/isit.2003.1228450.
Texto completoInformes sobre el tema "Perfect information"
Aghion, Philippe, Drew Fudenberg y Richard Holden. Subgame Perfect Implementation with Almost Perfect Information and the Hold-Up Problem. Cambridge, MA: National Bureau of Economic Research, julio de 2009. http://dx.doi.org/10.3386/w15167.
Texto completoPatschke, Gregory M. Information Operations And J-3: A Perfect Union. Fort Belvoir, VA: Defense Technical Information Center, febrero de 2004. http://dx.doi.org/10.21236/ada422717.
Texto completoStreb, Jorge M. y Gustavo Torrens. Meaningful Talk. Inter-American Development Bank, febrero de 2015. http://dx.doi.org/10.18235/0011676.
Texto completoChen, Stanley, Yaobin Chen, Renran Tian, Lingxi Li, Donglin Liu, Jue Zhou y Dan Shen. Alternate Interchange Signing Study for Indiana Highways. Purdue University, 2022. http://dx.doi.org/10.5703/1288284317439.
Texto completoGamba-Santamaria, Santiago, Luis Fernando Melo-Velandia y Camilo Orozco-Vanegas. What can credit vintages tell us about non-performing loans? Banco de la República de Colombia, febrero de 2021. http://dx.doi.org/10.32468/be.1154.
Texto completoChelala, Santiago y Gustavo Beliz. The DNA of Regional Integration: Latin American's Views on High Quality Convergence Innovation Equality and Care for the Environment. Inter-American Development Bank, octubre de 2016. http://dx.doi.org/10.18235/0010662.
Texto completoTang, Jiqin, Gong Zhang, Jinxiao Xing, Ying Yu y Tao Han. Network Meta-analysis of Heat-clearing and Detoxifying Oral Liquid of Chinese Medicines in Treatment of Children’s Hand-foot-mouth Disease:a protocol for systematic review. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, enero de 2022. http://dx.doi.org/10.37766/inplasy2022.1.0032.
Texto completoLópez Hernández, Hernán y Javier Valdés. ¿Qué son las cookies de internet? Autodeterminación informativa; un tema pendiente en tiempos de pandemia. Universidad Autónoma de Chile, noviembre de 2021. http://dx.doi.org/10.32457/20.500.12728/9696202151.
Texto completoGoeke, Pascal. Grundlagen wissenschaftlichen Arbeitens : ein verbindlicher Leitfaden und Ratgeber für Studierende der Geographie an der Johann Wolfgang Goethe-Universität Frankfurt am Main. Goethe-Universität, Institut für Humangeographie, noviembre de 2006. http://dx.doi.org/10.21248/gups.2111.
Texto completoGrumet, Rebecca, Rafael Perl-Treves y Jack Staub. Ethylene Mediated Regulation of Cucumis Reproduction - from Sex Expression to Fruit Set. United States Department of Agriculture, febrero de 2010. http://dx.doi.org/10.32747/2010.7696533.bard.
Texto completo