CSE 3305 Assignment 3 Answers
Problem 1 (5 marks)
Which of the following search methods can escape local optima? Answer: 1, 3, 4
1. Tabu search
2. Greedy search
3. Simulated annealing
4. Dijkstras alg
Denition 3 (Homomorphism)
A homomorphism is a mapping (function) from one structure (system) to another which
preserves relations, functions etc. in the rst under the mapping into the second.
Example:
CSE 3305 Assignment 1
Due: 23/3/07 5pm Weight: 10%
Assignments are to be submitted by email in a plain text (ascii) attachment (not html, doc or any other format). Whenever possible, answers are to be
Complexity Analysis
There are three main kinds of complexity analysis:
1. Worst case analysis
Useful for avoiding catastrophe. Variations: best case, etc.
2. Average (mean) case analysis
E.g., Ave(g(n
Modeling Choices
Modeling choices determine:
Adequacy of the model: can it represent the system of interest?
Efciency of the model: is the search space tractable?
Intelligibility of the model: can
Two possible representations for Tic-Tac-Toe (noughtsand crosses):
1. Bit string of 2 bit elds
00: empty
01: X
10: O
11: (meaningless)
2. Matrix of 0, 1, 2 (integers)
Disadvantages
25% of the sta
Different Orders
Search Complexity
Problem:
Search for x in an ordered list ()
L = hL1, . . . , Lni
returning the index or nil
We all know the algorithm!
1. i 1;
2. LOOP: IF Li = x RETURN i;
3. INC i;
Exhaustive Search
Denition 7 (Exhaustive search) Exhaustive search (potentially) examines every state of the
search space, for the optimum (given cost) or the goal state.
Exhaustive methods are worth
Discrete Event Simulation
Pick up the telescope and turn it around:
Basic unit of simulation is neither time nor agents
but
Events
Events occur (or, nish, really) in their own sweet time, whenever
What is Computer Science?
Theory
Limits of computation
Complexity: abstract comp theory; practical (analysis of algs)
Method
Problem solving, search
Simulation: stochastic search; discrete-state