Main Page

From wiki.doumith.net
Revision as of 23:20, 4 April 2016 by Doumith (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

MediaWiki has been successfully installed.

testing x_1 math c=\sqrt{x_1^2 + x_2^2}

\LARGE x=\frac{-b\pm\sqrt{b^2-4ac}}{2a} 

// SyntaxHighlighter makes your code snippets beautiful without tiring your servers.
var setArray = function(elems) {
    this.length = 0;
    push.apply(this, elems);
    return this;
}
% Select Java version SET JAVA VERSION 7_55 % Execute Euphemia on all the selected sessions EXEC EUPHEMIA @{\textcolor{mymauve}{SESSIONS}}@ % Execute the Cross-Check Module for all the selected sessions EXEC CROSS_CHECK "%~d0\DIR1\DIR2\CroosCheck_package" % Execute the PCR Key Indicators for the selected user </p> EXEC KEY_INDICATORS "%~d0\DIR1\DIR2\KeyIndicators_package"
#include <iostream> int main() { </p> <pre> // print hello to the console std::cout << "Hello, world!" << std::endl; return 0; </pre> }
public class Hello { </p> <pre> public static void main(String[] args) { // print hello to the console System.out.println("Hello, world!"); } </pre> }
Task List OK !! </p> Starting Simulation
\INPUT{$\mathcal{D}$ \COMMENT{set of requests},\\ $\beth_{max}$ \COMMENT{maximim allowable congestion},\\ $T_0$ and $Cnt_{max}$ \COMMENT{parameters of the algorithm}} </pre> <p>\OUTPUT{The path assigned to each request and the number of electrical ports and optical ports to be installed at each node} </p> <pre> \BEGIN \STEPNUM{Initializing} \STEP{Initial Solution $\Pi_0$ constructed by assigning the shortest path to each request. $\zeta_0$ is its cost and $\beth_0$ is its congestion.} \STEP{Current Solution $\Pi_c$ := Initial Solution $\Pi_0$} \STEP{$Cnt:=0$} </pre> <pre> \STEPNUM{Congestion Control} \STEP{\WHILE{($\beth_c > \beth_{max}$)}} \subSTEP{\IF{$Cnt>Cnt_{max}$}} \subsubSTEP{\RETURN{Unable to satisfy the congestion constraint.}} \ELSE \subsubSTEP{Apply perturbation. New Solution: $\Pi_n(\zeta_n,\beth_n)$} \subsubSTEP{$Cnt:=Cnt+1$} \subsubSTEP{\CASE{$(\beth_n-\beth_c)$}} \VALUE{\textbf{<0}} \subsubsubSTEP{$Cnt:=0$} </pre> \subsubsubSTEP{Accept new solution $\Pi_c$:=$\Pi_n$}


Consult the User's Guide for information on using the wiki software.

Getting started

Retrieved from "http://wiki.doumith.net/index.php?title=Main_Page&oldid=9"