{"id":34020,"date":"1998-01-01T00:00:00","date_gmt":"1998-01-01T00:00:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/sin-categoria\/precomputacion-en-grafos-de-dependencias-mediante-algoritmos-aproximados\/"},"modified":"1998-01-01T00:00:00","modified_gmt":"1998-01-01T00:00:00","slug":"precomputacion-en-grafos-de-dependencias-mediante-algoritmos-aproximados","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/precomputacion-en-grafos-de-dependencias-mediante-algoritmos-aproximados\/","title":{"rendered":"Precomputacion en grafos de dependencias mediante algoritmos aproximados."},"content":{"rendered":"<h2>Tesis doctoral de <strong> Antonio Salmer\u00f3n Cerd\u00e1n <\/strong><\/h2>\n<p>En la memoria se aborda el desarrollo de un esquema aproximado de inferencia basado en simulaci\u00f3n por monte carlo, en el cual la simulaci\u00f3n utilice, si es posible, toda la informaci\u00f3n disponible sobre el modelo. Esto conlleva la incorporaci\u00f3n de una fase de recopilaci\u00f3n de informaci\u00f3n previa a la simulaci\u00f3n.  se propone un m\u00e9todo aproximado de inferencia basado en muestreo por importancia, y que incorpora una fase de recopilaci\u00f3n de informaci\u00f3n llamada precomputaci\u00f3n aproximada. Esta fase es como una propagaci\u00f3n basada en eliminaci\u00f3n de variables, que lleva a la obtenci\u00f3n de funciones de muestreo pr\u00f3ximas a las exactas. Se comprueba experimentalmente que los nuevos m\u00e9todos ofrecen mejores resultados que los existentes.  la t\u00e9cnica de precomputaci\u00f3n aproximada se aplica posteriormente al caso en que la simulaci\u00f3n est\u00e1 dirigida mediante muestreo estratificado. En este caso los beneficios son similares a los del caso del muestreo por importancia. Ademas, se propone un esquema de organizaci\u00f3n de la simulaci\u00f3n llamado muestreo estratificado recursivo, que elimina los problemas de precisi\u00f3n cuando aumenta el n\u00famero de variables que forman el modelo.  se pasa entonces al estudio de la aplicaci\u00f3n de \u00e1rboles de probabilidad para mejorar la fase de precomputaci\u00f3n aproximada.  las t\u00e9cnicas desarrolladas para el caso de probabilidades se extienden al caso de la teor\u00eda de la evidencia. Para realizar las operaciones de forma eficiente se construye una representaci\u00f3n dispersa para las mismas, denominada representaci\u00f3n por semi ret\u00edculo.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Precomputacion en grafos de dependencias mediante algoritmos aproximados.<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Precomputacion en grafos de dependencias mediante algoritmos aproximados. <\/li>\n<li><strong>Autor:<\/strong>\u00a0 Antonio Salmer\u00f3n Cerd\u00e1n <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Granada<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 01\/01\/1998<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3>Direcci\u00f3n y tribunal<\/h3>\n<ul>\n<li><strong>Director de la tesis<\/strong>\n<ul>\n<li>Serafin Moral Callejon<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Luis Miguel De Campos Iba\u00f1ez <\/li>\n<li> Lasala Calleja Mar\u00eda  Pilar (vocal)<\/li>\n<li>Enrique Castillo Ron (vocal)<\/li>\n<li>Carmelo Rodriguez Torreblanca (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Antonio Salmer\u00f3n Cerd\u00e1n En la memoria se aborda el desarrollo de un esquema aproximado de inferencia basado [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"footnotes":""},"categories":[12487,1890,2528,126,1475],"tags":[45387,55920,7020,92227,22031,17147],"class_list":["post-34020","post","type-post","status-publish","format-standard","hentry","category-aplicacion-de-la-probabilidad","category-ciencia-de-los-ordenadores","category-inteligencia-artificial","category-matematicas","category-probabilidad","tag-antonio-salmeron-cerdan","tag-carmelo-rodriguez-torreblanca","tag-enrique-castillo-ron","tag-lasala-calleja-maria-pilar","tag-luis-miguel-de-campos-ibanez","tag-serafin-moral-callejon"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/34020","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/comments?post=34020"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/34020\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=34020"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=34020"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=34020"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}