{"id":5652,"date":"1995-01-01T00:00:00","date_gmt":"1995-01-01T00:00:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/1995\/01\/01\/diseno-y-validacion-de-nuevos-algoritmos-para-el-tratamiento-de-grafos-de-dependencias\/"},"modified":"1995-01-01T00:00:00","modified_gmt":"1995-01-01T00:00:00","slug":"diseno-y-validacion-de-nuevos-algoritmos-para-el-tratamiento-de-grafos-de-dependencias","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/diseno-y-validacion-de-nuevos-algoritmos-para-el-tratamiento-de-grafos-de-dependencias\/","title":{"rendered":"Dise\u00f1o y validacion de nuevos algoritmos para el tratamiento de grafos de dependencias."},"content":{"rendered":"<h2>Tesis doctoral de <strong>  Hernandez Molinero Luis Daniel <\/strong><\/h2>\n<p>En el capitulo i se da un repaso general al modo en que se representan las probabilidades en grafos y las tecnicas usuales de propagacion. Todos los metodos exactos pueden contemplarse como casos particulares de un metodo exacto basado en grupos de variables, y el factor clave de la eficiencia de este se encuentra en como realizar la triangulacion del grafo. El capitulo ii estudiara dicho problema. En el capitulo iii hemos formulado un esquema general basado en el muestreo por importancia, que permite generalizar algunas tecnicas aproximadas conocidas. Asi en dicho capitulo se presentaran los fundamentos de este muestreador y su aplicacion a grafos de dependencias. El punto clave del desarrollo se encuentra en la distribucion de importancia usada para muestrear. En este sentido, se presentan distintas alternativas en funcion de las distribuciones que definen el modelo y el orden en que se consideren. En el capitulo iv comenzaremos mostrando las ventajas e inconvenientes de los metodos exactos y aproximados y terminaremos presentando un metodo hibrido de ambos metodos. Igualmente se presenta en dicho estudio una tecnica de simplificacion de arboles de universos.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Dise\u00f1o y validacion de nuevos algoritmos para el tratamiento de grafos de dependencias.<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Dise\u00f1o y validacion de nuevos algoritmos para el tratamiento de grafos de dependencias. <\/li>\n<li><strong>Autor:<\/strong>\u00a0  Hernandez Molinero Luis Daniel <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Granada<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 01\/01\/1995<\/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 Callejo<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Miguel Delgado Calvo-flores <\/li>\n<li>Enrique Castillo Ron (vocal)<\/li>\n<li>Roque Mar\u00edn Morales (vocal)<\/li>\n<li>Fernando Martin Rubio (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Hernandez Molinero Luis Daniel En el capitulo i se da un repaso general al modo en que [&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":[1890,2528,126],"tags":[7020,4013,22002,4011,2538,22003],"class_list":["post-5652","post","type-post","status-publish","format-standard","hentry","category-ciencia-de-los-ordenadores","category-inteligencia-artificial","category-matematicas","tag-enrique-castillo-ron","tag-fernando-martin-rubio","tag-hernandez-molinero-luis-daniel","tag-miguel-delgado-calvo-flores","tag-roque-marin-morales","tag-serafin-moral-callejo"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/5652","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=5652"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/5652\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=5652"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=5652"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=5652"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}