For a graph G and for each vertex v ∈ V (G), let ΛG(v) = {EG(v, 1), EG(v, 2), . . . , EG(v, kv)} be a partition of the edges incident with v. Let ΛG = {ΛG(v) ∣∣ v ∈ V (G)}. We call the pair (G,ΛG) a partitioned graph. Let k = maxv kv and let g, f : V (G)×{1, . . . , k} → N and t, u : V (G)→ N be functions where for all vertices v ∈ V (G) (i) g(v, i) ≤ f(v, i) ≤ dG(v, i) i = 1, . . . , kv (ii) u...

0140-3664/$ see front matter 2008 Elsevier B.V. A doi:10.1016/j.comcom.2008.05.044 * Corresponding author. E-mail addresses: [email protected] (N. Be ensi.rnu.tn (A. Belghith). IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although such a proposition has been well studied, there are still some inherent problems ...

Different theories of syntactic ambiguity resolution argue for different sources of information determining initial parsing decisions (e.g., structurally defined parsing principles, lexically specific biases, or referential pragmatics). However, a "constraint-based" approach to syntactic ambiguity resolution proposes that both lexically specific biases and referential pragmatics are used in par...

The interest for providing services with performance guarantees across domain boundaries has driven recent technical solutions allowing the computation of constrained inter-domain paths. The computation of optimal paths subject to multiple constraints is an NP-complete problem for which efficient exact solutions exist in the intra-domain case. However, these solutions cannot be used for inter-d...

The origin of multiple constraints on a control function in both lumped and distributed systems is investigated. Equivalence and comparability notions are discussed. It is pointed out that multiple constraints have a special significance in optimal control problems of infinite-dimensional systems. An opt.ima1 control problem wit.h more than one const.raint. on the cont.ro1 function is called a ...

In this paper, we study the problem of routing under multiple constraints. We consider a graph where each edge is labeled with a cost and a delay. We then consider the problem of finding a path from a source vertex to a destination vertex such that the sum of the costs on the path satisfy the cost constraint and the sum of the delays satisfy the delay constraint. We present three different algo...

In this paper, we propose a SOC (system-on-chip) test scheduling technique that minimizes the test application time while considering test power limitations and test conflicts. The test power consumption is important to consider since exceeding the system’s power limit might damage the system. Our technique takes also into account test conflicts that are due to cross-core testing (testing of in...

In this report we present our work on a receiver-initiated approach called RIMQoS to support multicast with multiple QoS constraints and dynamic memberships. Assuming link-state information is available, a receiver computes a path to join the multicast tree rooted at the source. It then sends join request along the path to join the group. We first present the operation of our approach in an int...