Algorithms

MPEG TS {
 Packet Elementary Stream (Video){
  GOP {
   ### start code
   header information <--- your mission, should you choose to accept it.
   ...
  }
 }
}

Mustafa Ismail Mustafa wrote:

He wants two assignments, both solutions to the n-Queens problem, one using SM-A* (simplified memory bounded A*) and the other using GA.

Mustafa Ismail Mustafa wrote:

Cursed MSc.

Mustafa Ismail Mustafa wrote:

Financial Engineering

Mark Churchill wrote:

how to calculate shortest path between houses

Pseudocode for Longest Path
	Nodes of graph have integer names

Node Extensible( sequence s )
  Boolean found, Node endpoint
	p = EndOfPath(s)
        Set Inpath(x) = true for any x in s
	//LastUsed remembers last vertex used to extend s
	y = LastUsed(p)+1
        // now find first vertex which is :
        // not in use in s
        // adjacent to p
        // >= y
	found = false, q = y
        While q <= number of vertices And Not found
            found = Not InPath(q) And IsEdge(p, i)
            If Not found Then q = q + 1
        End While
        If Not found Then
            Extensible = -1
        Else
            Extensible = q
        End If

Sequence Truncate( sequence s )
        'Reset Lastused for EndofPath of s and remove EndofPath
         p = EndOfPath(s)
	 // p will be removed so reset Lastused
         Lastused(p) = 0
         If s.length = 1 then
		// choose new start vertex
		Truncate = s+1 // s is integer name for old start
        Else
                Truncate = all but last node of s
        End If

Sequence Extend( sequence s )
	 p = EndOfPath(s)
         q = Extensible(s)
            If q = -1 Then
                If s.Length > s*.Length Then s* = s
                // backtrack
                Extend = Truncate( s )
            Else
                Lastused(p) = q
                Extend = s + q
            End If
        End If

73Zeppelin wrote:

// now find first vertex which is :
// not in use in s
// adjacent to p
// >= y

73Zeppelin wrote:

If s.Length > s*.Length Then s* = s