X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/UIC2013.git/blobdiff_plain/6b73792718c22322203785b2fa9212e196ef29ab..8ab0f8781a3c93346920e6762d19e6ba7175f910:/bare_conf.tex?ds=sidebyside

diff --git a/bare_conf.tex b/bare_conf.tex
index 5aea4b7..206d113 100644
--- a/bare_conf.tex
+++ b/bare_conf.tex
@@ -420,7 +420,7 @@ U_{p} = \left \{
 \label{eq14} 
 \end{equation}
 
-\noindent Our coverage optimization problem can then be formulated as follows\\
+\noindent Our coverage optimization problem can then be formulated as follows
 \begin{equation} \label{eq:ip2r}
 \left \{
 \begin{array}{ll}
@@ -436,6 +436,9 @@ X_{j} \in \{0,1\}, &\forall j \in J
 \end{array}
 \right.
 \end{equation}
+
+
+
 \begin{itemize}
 \item $X_{j}$  : indicates whether or  not the sensor  $j$ is actively
   sensing in the round (1 if yes and 0 if not);
@@ -457,8 +460,6 @@ guarantee that  the maximum number  of points are covered  during each
 round.
  
 
-
-
 \section{Simulation results}
 \label{exp}
 
