Técnicas Completas | Técnicas Incompletas |
---|---|
Encuentra el óptimo global si existe | Busca el óptimo local |
Permite saber si no existe solución | Necesita una condición de termino |
Recorre todo el espacio de búsqueda | Encuentra soluciones factibles rápidamente |
En todas las ejecuciones entregan el mismo resultado | En cada ejecución entrega resultados diferentes |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{% extends "dashboard/base.html" %} | |
{% load static %} | |
{% load render_bundle from webpack_loader %} | |
{% block css %} | |
{% render_bundle 'home' 'css' %} | |
<link href="https://releases.transloadit.com/uppy/v2.7.0/uppy.min.css" rel="stylesheet"> | |
<style> | |
.content-header { | |
display: none; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
with recursive categories_from_parents as | |
( | |
-- Classes with no parent, our starting point | |
select id, name, '{}'::int[] as parents, 0 as level | |
from categories | |
where parent_id is NULL | |
union all | |
-- Recursively find sub-classes and append them to the result-set |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
bool dominates(const std::vector<double> &v, const std::vector<double> &w) { | |
if (v == w) { | |
return false; | |
} | |
size_t sum = 0; | |
for (size_t i = 0; i < v.size(); ++i) { | |
sum += v[i] <= w[i]; | |
} | |
return sum == v.size(); | |
} |