• Aucun résultat trouvé

[PDF] Top 20 Min-Max Coverage in Multi-interface Networks

Has 10000 "Min-Max Coverage in Multi-interface Networks" found on our website. Below are the top 20 most common "Min-Max Coverage in Multi-interface Networks".

Min-Max Coverage in Multi-interface Networks

Min-Max Coverage in Multi-interface Networks

... work Multi-interface wireless networks have been recently studied in a variety of con- texts, usually focusing on the benefits of multiple radio devices of each node [6, 9, ...reconsidered ... Voir le document complet

13

Connectivity in Multi-Channel Multi-Interface Wireless Mesh Networks

Connectivity in Multi-Channel Multi-Interface Wireless Mesh Networks

... = min(I v S 1 , I S v2 ) (3) In other words, any pair of nodes that would be a neighbor in the single channel network would also be a neighbor in the multi-channel case leading to a ... Voir le document complet

7

Bandwidth Constrained Multi-interface Networks

Bandwidth Constrained Multi-interface Networks

... work. Multi-interface wireless networks have recently been studied in a variety of contexts, usually focusing on the benefits of multiple radio devices of each ...reconsidered in such a ... Voir le document complet

13

Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks

Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks

... work. Multi-interface wireless networks have re- cently been studied in a variety of contexts, usually focus- ing on the benefits of multiple radio devices of each ...reconsidered in ... Voir le document complet

10

Minimize the Maximum Duty in Multi-interface Networks

Minimize the Maximum Duty in Multi-interface Networks

... active interface. Each interface is assumed to require an activation ...cost. In this paper, we consider two basic networking problems in the field of multi-interface ...the ... Voir le document complet

24

Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks

Broadcast Strategies with Probabilistic Delivery Guarantee in Multi-Channel Multi-Interface Wireless Mesh Networks

... After having constructed this schedule, the transmitter is able to compute the number of neighbors that can be covered for each interface for each timeslot (i.e. when the channels match). Thus, it will re-iterate ... Voir le document complet

5

Max-Min Lyapunov Functions for Switched Systems and Related Differential Inclusions

Max-Min Lyapunov Functions for Switched Systems and Related Differential Inclusions

... by max-min combinations is a Lyapunov function, establishing stability for two kinds of nonlinear dynamical systems: a) Differential inclusions where the set-valued right-hand-side comprises the convex hull ... Voir le document complet

27

Sketch of a theory of nonlinear partial information Min-Max control

Sketch of a theory of nonlinear partial information Min-Max control

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

29

Optimisation globale de problèmes Min-Max : application à la synthèse de loi de commande robuste

Optimisation globale de problèmes Min-Max : application à la synthèse de loi de commande robuste

... [3] Arzelier D., Clement B. and Peaucelle D. Multi-objective H 2 /H ∞ /impulse-to-peak control of a space launch vehicle. European Journal of Control, vol. 12(1), pp.57–70, 2006. [4] Monnet D., Ninin J. and ... Voir le document complet

3

Min/max time limits and energy penalty of communication scheduling in ring-based ONoC

Min/max time limits and energy penalty of communication scheduling in ring-based ONoC

... introduced in Section II, wavelength crosstalk appears when two wavelengths are close to each other and when an MR extracts power from its own resonant wavelength plus power from the neighbour ...crosstalk. ... Voir le document complet

7

Direct-Search for a Class of Stochastic Min-Max Problems

Direct-Search for a Class of Stochastic Min-Max Problems

... practice, min-max problems are often solved us- ing gradient-based algorithms, especially simultaneous gradient descent ascent (GDA) that simply alternates between a gradient descent step for x and a gradi- ... Voir le document complet

12

Differential approximation of MIN SAT, MAX SAT and related problems

Differential approximation of MIN SAT, MAX SAT and related problems

... In view of Proposition 15, what is different between standard and differential paradigms with respect to the GAP-reduction is that in the former such a reduction immediately concludes the impossibility for ... Voir le document complet

16

Complexity of the min-max (regret) versions of cut problems

Complexity of the min-max (regret) versions of cut problems

... bisection in G of value at most v if and only if there exists an s − t cut e C in e G with R max ( e C) ≤ v + (n 2 + ...3.2 Min cut Armon and Zwick [3] constructed a polynomial-time algorithm ... Voir le document complet

11

Differential approximation of MIN SAT, MAX SAT and related problems

Differential approximation of MIN SAT, MAX SAT and related problems

... paper. In this paper, we further study differential approximability of max sat, min sat, min dnf and max dnf, and give approximation results and inapproximability bounds for several ... Voir le document complet

16

A Tractable Coverage Analysis in Dynamic Downlink Cellular Networks

A Tractable Coverage Analysis in Dynamic Downlink Cellular Networks

... B. Traffic model We use a discrete time queueing system to model the random traffic arrival and departure processes. The packet arrival is modeled by an independent Bernoulli process with rate ξ ∈ [0, 1] and the rate of ... Voir le document complet

6

Multiple interface management in smart grid networks

Multiple interface management in smart grid networks

... Distributed Autonomous Depth-First Routing ( DADR ) [ Iwa+10 ] is a distance vector routing protocol but without any repair mechanism for the computed path. The protocol avoids the frequent control overhead required for ... Voir le document complet

155

Robust k-coverage algorithms for sensor networks

Robust k-coverage algorithms for sensor networks

... of coverage in large-scale sensor networks is ...presented in [#4]. A comprehensive study on both coverage and connectivity issues can be found in ...[#13]. In [#1] new ... Voir le document complet

16

Connectivity-based Distributed Coverage Hole Detection in Wireless Sensor Networks

Connectivity-based Distributed Coverage Hole Detection in Wireless Sensor Networks

... broadcast in this round, they can neglect the ...shown in the ...shown in Figure ...2. In the second round, nodes 3, 6, 7 and 21 will ...shown in Figure ...shown in Figure ... Voir le document complet

7

A max-min principle for the ground state of the Dirac-Fock functional

A max-min principle for the ground state of the Dirac-Fock functional

... One way to deal with this problem, is to restrict the energy functional to the space + E N , + being the projector on the space of positive states of a perturbed Dirac operator H0 +.. No[r] ... Voir le document complet

9

A Min-Max certainty equivalence principle for non-linear discrete-time control problems

A Min-Max certainty equivalence principle for non-linear discrete-time control problems

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

16

Show all 10000 documents...