<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/"><channel><atom:link href="http://unow.nottingham.ac.uk/rss.ashx" rel="self" type="application/rss+xml" /><title>Nottingham U-Now</title><link>http://unow.nottingham.ac.uk</link><description>U-Now is the University of Nottingham's formal open courseware initiative.</description><dc:date>2013-05-22</dc:date><dc:publisher>University of Nottingham</dc:publisher><dc:language>en-gb</dc:language><copyright><![CDATA[Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a <a target="blank" href="http://creativecommons.org/licenses/by-nc-sa/2.0/uk/">Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA)</a>]]></copyright><item><category>UNow</category><title>Editing files and Emacs</title><link>http://unow.nottingham.ac.uk/resources/resource.aspx?hid=8e66ce07-2e06-b4f7-b848-ba10289f51eb</link><pubDate>Fri, 08 Oct 2010 11:37:09 GMT</pubDate><guid isPermaLink='true'>http://unow.nottingham.ac.uk/resources/resource.aspx?hid=8e66ce07-2e06-b4f7-b848-ba10289f51eb</guid><dc:contributor>University Of Nottingham</dc:contributor><dc:type>Course</dc:type><dc:format>text/html</dc:format><dc:format>audio/mpeg</dc:format><dc:format>undefined</dc:format><dc:language>en-gb</dc:language><dc:relation></dc:relation><dc:rights><![CDATA[Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a <a target="blank" href="http://creativecommons.org/licenses/by-nc-sa/2.0/uk/">Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA)</a>]]></dc:rights><cc:license><![CDATA[Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a <a target="blank" href="http://creativecommons.org/licenses/by-nc-sa/2.0/uk/">Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA)</a>]]></cc:license><dc:description><![CDATA[This emacs lecture is given as part of the course G51UST, Unix Software Tools. The course gives an introduction to the Unix operating system. It teaches students how to use the Command Line Interface that is part of Unix and also teaches them how to write shell, sed and awk. In doing so the course covers the use of editors such as Emacs and vi with which the students can write their scripts.

It is presented in 3 formats:

    * Screencast (video of the lecturer and presentation slides)
    * Audiocast (audio of the lecturer and presentation slides)
    * MP3 (Audio only)

Suitable for study at undergraduate level 1.

As taught Spring Semester 2010.

Dr Gail Hopkins, Computer Science]]></dc:description><description><![CDATA[This emacs lecture is given as part of the course G51UST, Unix Software Tools. The course gives an introduction to the Unix operating system. It teaches students how to use the Command Line Interface that is part of Unix and also teaches them how to write shell, sed and awk. In doing so the course covers the use of editors such as Emacs and vi with which the students can write their scripts.

It is presented in 3 formats:

    * Screencast (video of the lecturer and presentation slides)
    * Audiocast (audio of the lecturer and presentation slides)
    * MP3 (Audio only)

Suitable for study at undergraduate level 1.

As taught Spring Semester 2010.

Dr Gail Hopkins, Computer Science]]></description><dc:date>2010-10-08</dc:date><dc:title>Editing files and Emacs</dc:title><dc:creator>Hopkins Gail</dc:creator><dc:publisher>University of Nottingham</dc:publisher><dc:subject>emacs</dc:subject><dc:subject>unix operating system</dc:subject><dc:subject>g51ust</dc:subject><dc:subject>unix software tools</dc:subject><dc:subject>command line interface </dc:subject><dc:subject>shell</dc:subject><dc:subject>sed</dc:subject><dc:subject>awk</dc:subject><dc:subject>ukoer</dc:subject><dc:subject>scripts</dc:subject></item><item><category>UNow</category><title>Heuristic local search tutorial</title><link>http://unow.nottingham.ac.uk/resources/resource.aspx?hid=5ade2b04-6d82-79cf-24b1-236084d32121</link><pubDate>Fri, 28 Oct 2011 11:46:57 GMT</pubDate><guid isPermaLink='true'>http://unow.nottingham.ac.uk/resources/resource.aspx?hid=5ade2b04-6d82-79cf-24b1-236084d32121</guid><dc:contributor>University Of Nottingham</dc:contributor><dc:type>Course</dc:type>text/html<dc:language>en-gb</dc:language><dc:relation></dc:relation><dc:rights><![CDATA[Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a <a target="blank" href="http://creativecommons.org/licenses/by-nc-sa/2.0/uk/">Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA)</a>]]></dc:rights><cc:license><![CDATA[Except for third party materials (materials owned by someone other than The University of Nottingham) and where otherwise indicated, the copyright in the content provided in this resource is owned by The University of Nottingham and licensed under a <a target="blank" href="http://creativecommons.org/licenses/by-nc-sa/2.0/uk/">Creative Commons Attribution-NonCommercial-ShareAlike UK 2.0 Licence (BY-NC-SA)</a>]]></cc:license><dc:description><![CDATA[The Problem:

Real-world problems are usually (if not always) considered hard to be solved because:

* Problems cannot always be represented and solved with a straightforward mathematical approach.
* A lot of parameters and constraints are involved.
* The number of possible solutions to a problem can be huge.
* Good solutions need to be found fast
* Checking every possible solution, for finding the best one, is time consuming and sometimes not  even feasible.
* The quality of a solution may vary according to time, thereby; more than one different solution might be required.

Heuristic Search:

Heuristic search refers to techniques with the aim of finding ‘good’ solutions for a very hard optimization and decision within a reasonable amount of computation time.

Heuristic Local Search:

* A basic heuristic search technique that works with complete solutions and seeks to find better solutions by making small local changes.
* All heuristic search techniques share similar concepts; e.g. the search space, feasible/infeasible solutions, neighbourhoods, and the relation(s) between neighbours.
* Good understanding of the above concepts and how a basic local search works, is a key knowledge necessary to anyone who wishes to learn and work with heuristic and metaheuristic algorithms for solving hard real-world optimization problems.
]]></dc:description><description><![CDATA[The Problem:

Real-world problems are usually (if not always) considered hard to be solved because:

* Problems cannot always be represented and solved with a straightforward mathematical approach.
* A lot of parameters and constraints are involved.
* The number of possible solutions to a problem can be huge.
* Good solutions need to be found fast
* Checking every possible solution, for finding the best one, is time consuming and sometimes not  even feasible.
* The quality of a solution may vary according to time, thereby; more than one different solution might be required.

Heuristic Search:

Heuristic search refers to techniques with the aim of finding ‘good’ solutions for a very hard optimization and decision within a reasonable amount of computation time.

Heuristic Local Search:

* A basic heuristic search technique that works with complete solutions and seeks to find better solutions by making small local changes.
* All heuristic search techniques share similar concepts; e.g. the search space, feasible/infeasible solutions, neighbourhoods, and the relation(s) between neighbours.
* Good understanding of the above concepts and how a basic local search works, is a key knowledge necessary to anyone who wishes to learn and work with heuristic and metaheuristic algorithms for solving hard real-world optimization problems.
]]></description><dc:date>2011-10-28</dc:date><dc:title>Heuristic local search tutorial</dc:title><dc:creator>Zapiti Maria</dc:creator><dc:publisher>University of Nottingham</dc:publisher><dc:subject>ukoer</dc:subject><dc:subject>combinatorial </dc:subject><dc:subject>objective functions</dc:subject><dc:subject>evalutaion</dc:subject><dc:subject>functions</dc:subject><dc:subject>evaluation functions</dc:subject><dc:subject>search space size</dc:subject><dc:subject>the knapsack problem</dc:subject></item></channel></rss>