Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
I
ia-coursera
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
CI / CD
CI / CD
Pipelines
Schedules
Wiki
Wiki
Snippets
Snippets
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Commits
Issue Boards
Open sidebar
Stalin Munoz
ia-coursera
Commits
52cdd879
Commit
52cdd879
authored
Sep 21, 2018
by
Stalin Munoz
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Avance sobre DLS
parent
6231f607
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
6 additions
and
0 deletions
+6
-0
curso-search/dls.log
+0
-0
curso-search/dls.pdf
+0
-0
curso-search/dls.synctex.gz
+0
-0
curso-search/dls.tex
+6
-0
No files found.
curso-search/dls.log
View file @
52cdd879
This diff is collapsed.
Click to expand it.
curso-search/dls.pdf
View file @
52cdd879
No preview for this file type
curso-search/dls.synctex.gz
View file @
52cdd879
No preview for this file type
curso-search/dls.tex
View file @
52cdd879
...
...
@@ -125,6 +125,12 @@ La razón más importante, es la de evitar que el agente caiga en un ciclo infinit
Al controlar la profundidad máxima de la búsqueda, DLS no podrá caer en un ciclo infinito.
A lo más dará vueltas un número finito de veces.
Esto puede sonar muy ineficiente.
Sin embargo el ahorro en memoria es sustancial.
Además, se tiene control total sobre los recurso computacionales del algoritmo a través de la cota de profundidad.
}
\end{frame}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment