Generalized Edge Coloring for Channel Assignment in Wireless Networks
|
|
- Poppy Robinson
- 5 years ago
- Views:
Transcription
1 TR-IIS Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS
2 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-Wei Wang Jan-Jan Wu Institute of Information Science Acaemia Sinica Taipei, Taiwan Pangfeng Liu Department of Computer Science an Information Engineering National Taiwan University Taipei, Taiwan Abstract This paper introuces a new graph theory problem calle generalize ege coloring (g.e.c). g.e.c is similar to traitional ege coloring, with the ifference that a vertex can be ajacent to up to k eges that share the same color. g.e.c. can be use to formulate the channel assignment problem in multi-channel multi-interface wireless networks. We provie theoretical analysis for this problem. Our theoretical finings can be useful for system evelopers of wireless networks. We show that when k = 3, there is no optimal solution. When k =2anthemaximum egree of the graph is no more than 4, or is a power of 2, we erive optimal algorithms to fin a g.e.c. Furthermore, if given one extra color, we can fin a g.e.c. that uses minimum number of ege colors for each vertex. 1 Introuction Many moern wireless LAN stanars, such as IEEE b/802.11g [2] an IEEE a [1], provie multiple non-overlappe frequency channels that can be use simultaneously within a neighborhoo. Ability to utilize multiple channels substantially increases the effective banwith available to wireless network noes [3, 10, 12, 11]. One way to utilize multiple channels is to equip each noe with multiple network interface cars (NICs) [7]. For irect communication, two noes nee to be within communication range of each other, an nee to have a common channel assigne to their interfaces. Noe pairs using ifferent channels can communicate simultaneously without interference. Furthermore, since the number of interface cars per noe is limite, each noe typically uses one interface to communicate with multiple of its neighbors. The channel assignment problem is to bin each neighbor to a network interface an also bin each network interface to a raio channel with the goal to minimize interference [7, 12] Specifically, we consier channel assignment that satisfies the following constraints: (1) The total number of raio channels assigne to a wireless noe is boune by the number of network interface cars it has, (2) the capacity of a raio channel within a communication range is boune by a constant number k; the consequence is that an interface on a noe can communicate with up to k neighboring noes, an (3) two noes that nee to communicate 1
3 with each other irectly shoul share at least one common channel. Clearly, the channel assignment for each network interface affects the number of interface cars a noe must have in orer to communicate with all of its neighbors. It also affects the total number of channels that are actually use. Graph coloring seems to be a natural formulation for this problem. However, stanar vertex coloring [8, 4] (an more recently, vertex-multi-coloring) [5] cannot capture the thir constraint that communicating vertices nee to be assigne a common color. Stanar ege coloring [8] fails to capture the secon constraint that no more than k colors can be assigne to the ajacent eges of a vertex. In this paper, we introuce a new graph theory problem calle generalize ege coloring (g.e.c.). Generalize ege coloring is similar to traitional ege coloring, with the ifference that a vertex can be ajacent to up to k eges that share the same color. We show that the channel assignment problem escribe above can be formulate as a generalize ege coloring problem as follows. By picking a color for an ege, we assign the channel number on the two interfaces on two neighboring noes. By restricting the number of ajacent eges that have the same color, we limit the number of neighbors that can communicate with the same interface. In this paper, we provie theoretical analysis for the generalize ege coloring problem. Our theoretical finings are interesting an can be useful for system evelopers of multi-channel multi-interface wireless networks. There are two criteria to evaluate the quality of a generalize ege coloring. The first is the total number of colors use (which is equivalent to the total number of channels use in the wireless network), an the secon is the number of ege colors ajacent to a vertex (which is equivalent to the number of network interface cars on each noe). An optimal g.e.c. shoul use only D k channels where D is the maximum egree of the wireless mesh network, an for each noe with neighbors, it shoul use only k network interfaces. We show that when k is 3, it is impossible to fin optimal g.e.c. for some graphs. However, when k is 2, we have an optimal algorithm for several cases: (1) when D is no more than 4,(2) when D is a power of 2, or (3) the graph is bipartite. In aition, if we are given one extra channel, we can erive a g.e.c. that achieves optimal number of interfaces for each noe. This is very similar to the case of traitional ege coloring where k is 1, an fining an ege coloring with D colors is NP-complete, but it is always possible to color any graph with D +1colors. The rest of the paper is organize as follows. Section 2 formally efines the generalize ege coloring an the quality measurement criteria. Section 3 escribes our results on the generalize ege coloring problem. Finally Section 4 conclues with some interesting open problems in this research topic. 2 Problem This section efines our terminology about generalize ege coloring. Given a graph G = (V,E) we color every ege with mapping function f from E to a color set C. Inparticular, we require that every noe in V isajacenttoatmostk eges of the same color. As a result the traitional ege coloring is a special case when k is 1. We can erive some trivial lower bouns on the number of colors require. For example, let D be the maximum egree of G, then we nee at least D k colors to color G. Also if the number of neighbors of a noe v is v, the number of colors require to color the eges ajacent to v is v k. We efine the global iscrepancy of a coloring function f as ifference between the total number of colors f actually uses an the lower boun D k, i.e. C D k. Similarly we efine the local iscrepancy of a noe v to be the ifference between the actual number of colors ajacent to a noe v an the lower boun v k, i.e. n(v) v k,where n(v) is the number of colors ajacent to v uner f. The maximum local iscrepancy is the maximum among all the local iscrepancy, i.e. max v (n(v) v k ). 2
4 We now use the global an the maximum local iscrepancy to evaluate the quality of a coloring function. A coloring function is a (k, g, l) generalize ege coloring if every noe in V is ajacent to at most k eges of the same color, the global iscrepancy is boune by g, an the maximum local iscrepancy is boune by l. For example, we know that the problem of etermining whether a graph has a (1, 0, 0) g.e.c. is NP-complete, an the Vizing s theorem says that it is always possible to fin a (1, 1, 0) g.e.c. for any graph. A generalize ege coloring is optimal if an only if it is a (k, 0, 0) coloring. 3 Results We first give an impossibility result on the case of k 3, an show that there are cases that we cannot fin (k, 0, 0) g.e.c. for them. The construction is as follows. First we construct aringof2k noes, an each noe is connecte to its two neighbors with two eges. This leaves k 2 eges for each noes along the ring. Now we place k 2 noes in the mile of the ring, an connect each one of them to every noe along the ring. Now each noe in the mile has egree 2k. Suppose we can fin a (k, 0, 0) g.e.c. for this graph, the eges along the ring must be colore with the same color, since each noe along the ring is of egree k, an from the 0 local iscrepancy requirement, it can have at most one color. This forces all the eges going to the noes in the mile to be colore with the same color, which violates the requirement that a noe can be ajacent to at most k eges of the same color. Figure 1 illustrates the constructe graph when k is 3. Figure 1: A graph without (3, 0, 0) g.e.c. From now on we focus on the case where k is 2. We will show that when the maximum egree is boune by 4, we can always fin (2, 0, 0) g.e.c. using Euler cycle. 3.1 Euler Cycle It is well known that a graph has a Euler cycle if an only if every noe is of even egree. We will construct a (2, 0, 0) g.e.c. base on the Euler cycle. The first step of our algorithm is to pair up all the noes with egree 1 or 3, so that every noe is now of egree 2 or 4. Since the number of o-egree noes in a graph is always an even number, the step will not leave any o-egree noes. We use G to enote the graph after transformation. The secon step is to remove some egree 2 noe to simplify the later coloring process. Consier the noes with egree 2 these noes are all on paths that connect egree 4 noes. If the path connect two ifferent egree 4 noes, as in Figure 2 (a), we remove all of them an place a single ege. If the path goes back to the same egree 4 noe an forms a self loop, as in Figure 2 (b), we remove all but two noes from the path. We enote the transforme graph as G. 3
5 (a) (b) Figure 2: Two cases to remove some egree 2 noes. Now we construct a Euler cycle for the transforme graph. Since every noe is of egree 2 or 4, the construction is possible. We then inex each ege with a sequence number accoring to the orer it appears in the cycle. For all eges that have even inices we color them with 0, an the other eges are colore with 1. Lemma 1 The Euler cycle constructe from G has even length, an every noe has the same number of ajacent eges that are colore with 0 an 1. Proof. The length of the Euler cycle is equal to the number of eges in G, which is equal to the sum of all egrees of noes in G ivie by 2. Since there are only egree 4 noes an pairs of egree 2 noes in G, the Euler cycle has even length. In aition, the color are given in alternative manner, each egree 4 noe has two eges of 0 an two eges of 1, an each egree 2 noe has one 0 ege an one 1 ege. Now we nee to erive the actual coloring function for G. If a set of noes is replace by a single ege since the path they form connects two ifferent egree 4 noes, the entire path is colore with the same color from the G coloring. This is feasible since k is 2. On the other han, if a path form a self loop an is replace by a path of length 3 (with two egree 2 noes), the first an the thir ege is colore the same color ue to the alternating coloring. As a result we can color all the noes in that path with the same color. Note that this special treatment is necessary, otherwise the alternating coloring process will be complicate. Finally we nee to remove the ae eges from G. We only ae eges to those noes in G that have egree 1 or 3. These noes in G now has the same number of eges colore by 0or1,sonomatterwhichegeweremove,thelocal iscrepancy will not increase. Formally we have the following theorem. Theorem 2 There exists a (2, 0, 0) generalize ege coloring for every graph with maximum egree boune by 4. The pseuo coe of the alternating coloring process is as follows. 3.2 One Extra Color We now escribe an algorithm that fins (2, 1, 0) g.e.c. for every graph. It is well known that although to etermine if a graph allows a (1, 0, 0) g.e.c. is NP-complete, to fin a (1, 1, 0) 4
6 proceure AlternatingColoring 1. Pair up o-egree noes an a eges. 2. Remove some egree 2-noes accoring to Figure Fin a Euler cycle. 4. Color the eges alternatively with 0 or Color the eges along the path in Figure 2. with the same color. 6. Remove eges ae in step 1. Figure 3: The pseuo coe of fining a (2, 0, 0) g.e.c. for graph with maximum egree 4. g.e.c. in polynomial time is always possible from Vizing s theorem [13]. Therefore the first step of our algorithm is fin a (1, 1, 0) g.e.c. Now we will reuce the number of color by half. Let D be the maximum egree of the graph G. From Vizing s theorem we know that we nee at most D+1 colors to come up with a(1.1.0) g.e.c. By grouping two colors into a new color, we will have at most D+1 2 new colors. Since the original coloring is a (1, 1, 0) g.e.c. The new coloring is a (2, 1,L)where L is about D 4. The reason is that we might use one more color than the D 2 lower boun, an a noe with D 2 eges may still have D 2 new colors ajacent to it after we combine colors, which is about D 4 higher than the D 4 lower boun, hence the maximum local iscrepancy can go up to about D 4. Now we want to reuce the maximum local iscrepancy to 0. The iea is to fin a noe v an two colors c an so that v is ajacent to exactly one ege (enote by (v, w)) colore by c, an one ege (enote by (v, u)) colore by. If we can change the color of (v, w) from c to without increasing the local iscrepancy of w, we can reuce the local iscrepancy of v. For ease of notation we use N(v, c) to enote the number of eges ajacent to v that are colore c. If we can o this for every noe v that has N(v, c) =N(v, ) = 1 for two colors c an, we can reuce the maximum local iscrepancy to 0 by repeately changing the c to for every noe v that has N(v, c) =N(v, ) =1. The key operation for changing color is to fin a c path. The iea about c path is inspire by [9]. Without lose of generality we assume that we want to change color c to. A c path is efine as follows: A c path starts from v, goes through the unique ege (v, w) that is colore c, travels along only eges colore with c or, an ens at a noe other than v. If we exchange the colors of the eges between c an along the c path, we will not increasing the local iscrepancy of any noe along the path. Suppose we can alway fin a c path from v, we can reuce the maximum local iscrepancy to 0. The c path construction is as follows: We always check for whether the current path uner consieration is alreay a c path. If so, we stop an eclare that a path is foun. If not we exten the current path an hope that we can stop at the next ege. Initially the path uner consieration is from v to w, i.e. the unique ege colore c. There are several case to consier while etermining whether we shoul stop or exten. Withoutloseofgeneralityweassumethewejustextentoanoexthrough an ege colore c. Similar argument can be mae for an ege colore, since we are extening a path that coul have both color c an. If N(x, c) =1anN(x, ) = 0, we stop at x since x is ajacent to one c, an changing that only c to will not increase the local iscrepancy of w. In the secon case we have N(x, c) =2anN(x, ) = 0. We cannot stop at x in this case since that will increase the number of colors ajacent to x by one. As a result we exten the c path through the other ege colore by c. Note that changing both c will not increase 5
7 the local iscrepancy of x, an we only exten the path by one more noe. In the thir case we have N(x, ) = 1. In this case we can stop at w since both (x, c) an N(x, ) are greater than 0. Changing the incoming c ege will not increase the number of colors ajacent to x, an since there is only one ege before the change, aing another one will not violate the k = 2 constraint either. In the final case we have N(x, ) = 2. In this case we cannot stop at x, otherwise the number of eges ajacent to x will be 3, violating the k =2constraint. Asaresultwe pick an ege colore by an extent the path. Since each ege can only be use once in the process, eventually the process must stop an we fin a c path. The only complication is that the en noe might be v, therefore we will not be able to reuce the local iscrepancy of v. The following lemma says that we can always fin a c path that stops at a noe other than v. v c w c n j i c h m Figure 4: There exists a c path that starts from v but oes not en at v. Lemma 3 There exists a c path that stops at a noe other than v. Proof. Assume that we construct a c path an eventually go back to v by a cycle C. Since the path starts with a c ege an ens with a ege, let h enote the last noe that extens a c ege, an this ege leas to noe i. Since uring the construction we exten through noe i, therefore N(i, ) = 2 an there exists another ege (i, m) that is colore. See Figure 4 for an illustration. If we pick (i, m) to exten (instea of (i, j)) the c path, it will be impossible to get back to v. The reason is that both N(v, c) ann(v, ) are 1, so the only way back to v is through the ege. Please refer to Figure 4 for an illustration. If the c path oes reach v, wetracebackfromv to the noe where it branches off the cycle C at noe n. By efinition we know that we will see only eges before n, an we branch off C via a c ege, ue to the k = 2 constraint. Recall that uring the construction of C, whenweentern we will leave through another ege only if there is no c ege ajacent to n (from the secon case above). However, we o have N(n, c) > 0 an this contraicts to the formation of C. As a result we can be assure that there exists a c path that will not go back to v. Theorem 4 There exists a (2, 1, 0) generalize ege coloring for every graph. 3.3 Power of 2 We now escribe an algorithm that construct a (2, 0, 0) for every graph with maximum egree as a power of 2, i.e., the graph G =(V,E) has the maximum egree D =2 for an positive integer. 6
8 The basic iea of the construction is to ivie the original graph G into two subgraphs, so that the maximum egrees of both subgraphs are equal. Recall that uring the construction of (2, 0, 0) g.e.. for D 4, we use a Euler cycle to color every ege so that that the number of 0-eges an 1-eges ajacent to a noe iffer by at most 1. Now we apply the alternating coloring process (Figure 3) to G, then ivie the eges accoring to their colors. We have two inuce subgraphs G 0 =(V,E 0 )ang 1 =(V,E 1 ), where E 0 are those eges in G that are colore 0, an E 1 are those colore by 1. Both the maximum egree of G 0 an G 1 are 2 1. We can recursive apply this coloring process until the maximum egree is own to 4, an erive a (2, 0, 0) for each subgraph. Now when we put all these g.e.c. together an view those colors in ifferent g.e.c. s as ifferent colors, we have a (2, 0, l) g.e.c. (enote by C),wherel is the maximum local iscrepancy. Note that the key point of this construction is that we use only D colors to color the entire graph, so the global iscrepancy is 0. Next we nee to reuce the local iscrepancy of C for every noe. Recall that uring the construction for the (2, 1, 0) in Section 3.2, we are able to convert a color c ege into a ege, as long as they are ajacent to the same noe v an there is no other eges colore by c or ajacent to v. We now apply the same technique to the coloring C obtaine in the previous step. As long as there exists a noe v an two colors c an so that N(v, c) =N(v, ) =1, we convert the c ege into an ege, without increasing the local iscrepancy of other noes. We repeat this step, just as we i in the construction of (2, 1, 0), an eventually will convert C into a (2, 0, 0) g.e.c. Theorem 5 There exists a (2, 0, 0) generalize ege coloring for every graph with maximum egree as a power of Bipartite graph It is well known that given a bipartite graph with maximum egree D, we can fin an ege coloring with D colors in polynomial time [6]. In our terminology, it is easy to compute a (1, 0, 0) g.e.c. for bipartite graphs. By combining this (1, 0, 0) g.e.c. with the concept of c path, we are able to fin (2, 0, 0) g.e.c. for every bipartite graph. Given a bipartite graph, the algorithm first fins an ege coloring with D colors. We then group the colors into D 2 new colors. This results in a (2, 0,l) g.e.c. where l is the new local iscrepancy. We then examine every noe v. If there are two colors c an, sothat N(v, c) =N(v, ) = 1, we fin a c path for them. Eventually we have a (2, 0, 0) g.e.c. Theorem 6 There exists a (2, 0, 0) generalize ege coloring for every bipartite graph. 4 Conclusion This paper introuces a new graph theory problem calle generalize ege coloring. We show that when the number of eges of same color is limite to 3, it is impossible to fin optimal g.e.c. for some graphs. However, when the limitation is 2, we have an optimal algorithm when D is no more than 4, or is a power of 2, or the graph is bipartite. In aition, if we are given one extra color, we can erive an generalize ege coloring that achieves optimal number of colors for each noe. This is similar to the case of traitional ege coloring where k is 1 fining an ege coloring with D colors is NP-complete, but it is always possible to color any graph with D +1colors. There are several interesting open problems along this line of research. For example, although it is impossible to fin (k, 0, 0) g.e.c. for k 3, is it possible to fin a (k, 1, 0) solution, just like the case when k is 2? Also we can erive optimal g.e.c. for k =2an some special values of maximum egree D, is it true that we can always fin optimal g.e.c. for any maximum egree D? The authors will continue the investigation on these interesting problems. 7
9 This paper is the result of a summer visit program, hoste by Institute of Information Science, Acaemia Sinica. The authors thank the institute for the support. References [1] Ieee a stanar pf. [2] Ieee b stanar pf. [3] V. Bahl, A. Aya, J. Pahye, an A. Wolman. Reconsiering the wireless lan platform with multiple raios. In Workshop on Future Directions in Network Architecture (FDNA), [4] J. A. Bonay an U.S.R. Murty. Graph Theory with Applications. American Elsevier, New York, [5] T. R. Jensen an B. Toft. Graph Coloring Problems. Wiley Interscience, New York, [6] D. König. Über Graphen un ihre Anwenung auf Determinantentheorie un Mengenlehre. Mathematische Annalen, 77: , [7] P. Kyasanur an N. H. Vaiya. Routing an interface assignment in multi-channel multi-interface wireless networks. In in Proceeings of IEEE WCNC, [8] D. W. Matula, G. Marble, an J. F. Issacson. Graph Theory an Computing, chapter Graph Coloring Algorithms. Acaemic Press, New York, [9] J. Misra an Davi Gries. A constructive proof of Vizing s theorem. Information Processing Letters, 41(3): , March [10] A. Nasipuri an Samir R. Das. A multichannel csma mac protocol for mobile multihop networks. In in Proceeings of IEEE WCNC, [11] A. Raniwala an T. Chiueh. Architecture an algorithms for an ieee base multi-channel wireless mesh network. In in Proceeings of IEEE INFOCOM, [12] A. Raniwala, K. Gopalan, an T. Chiueh. Centralize channel assignment an routing algorithms for multi-channel wireless mesh networks. ACM Mobile Computing an Communications Review (MC2R), 8:50 65, [13] V. G. Vizing. On an estimate of the chromatic class of a p-graph (in Russian). Diskret. Analiz, 3:23 30,
Generalized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationThe Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract
The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie
More information2-connected graphs with small 2-connected dominating sets
2-connecte graphs with small 2-connecte ominating sets Yair Caro, Raphael Yuster 1 Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel Abstract Let G be a 2-connecte graph. A
More informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationTHE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM
International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationPreamble. Singly linked lists. Collaboration policy and academic integrity. Getting help
CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure
More informationNAVAL POSTGRADUATE SCHOOL THESIS
NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS REALIZABLE TRIPLES IN DOMINATOR COLORINGS by Douglas M. Fletcher II June 2007 Thesis Co-Avisors: Ralucca Gera Craig Rasmussen Approve for public release;
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More informationDistributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationOptimal Oblivious Path Selection on the Mesh
Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationAd-Hoc Networks Beyond Unit Disk Graphs
A-Hoc Networks Beyon Unit Disk Graphs Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerlan {kuhn, wattenhofer, zollinger}@inf.ethz.ch ABSTRACT
More informationAlgebraic transformations of Gauss hypergeometric functions
Algebraic transformations of Gauss hypergeometric functions Raimunas Viūnas Faculty of Mathematics, Kobe University Abstract This article gives a classification scheme of algebraic transformations of Gauss
More informationDisjoint Multipath Routing in Dual Homing Networks using Colored Trees
Disjoint Multipath Routing in Dual Homing Networks using Colore Trees Preetha Thulasiraman, Srinivasan Ramasubramanian, an Marwan Krunz Department of Electrical an Computer Engineering University of Arizona,
More informationAdditional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication
Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.eu 6.854J / 18.415J Avance Algorithms Fall 2008 For inormation about citing these materials or our Terms o Use, visit: http://ocw.mit.eu/terms. 18.415/6.854 Avance Algorithms
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationComputer Organization
Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.
More informationMultilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis
Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT
More informationLearning Polynomial Functions. by Feature Construction
I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate
More informationSolutions to Tutorial 1 (Week 8)
The University of Syney School of Mathematics an Statistics Solutions to Tutorial 1 (Week 8) MATH2069/2969: Discrete Mathematics an Graph Theory Semester 1, 2018 1. In each part, etermine whether the two
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationCS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing
CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing Tim Roughgaren October 19, 2016 1 Routing in the Internet Last lecture we talke about elay-base (or selfish ) routing, which
More information4.2 Implicit Differentiation
6 Chapter 4 More Derivatives 4. Implicit Differentiation What ou will learn about... Implicitl Define Functions Lenses, Tangents, an Normal Lines Derivatives of Higher Orer Rational Powers of Differentiable
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationIntensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2
This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar
More informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationPERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING
PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING PAMELA RUSSELL ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. Birchall an Teor prove that
More informationImproving Performance of Sparse Matrix-Vector Multiplication
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science an Center of Simulation of Avance Rockets University of Illinois at Urbana-Champaign
More informationMessage Transport With The User Datagram Protocol
Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer
More informationRobust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks
Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,
More informationarxiv: v1 [math.co] 15 Dec 2017
Rectilinear Crossings in Complete Balance -Partite -Uniform Hypergraphs Rahul Gangopahyay Saswata Shannigrahi arxiv:171.05539v1 [math.co] 15 Dec 017 December 18, 017 Abstract In this paper, we stuy the
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationDesign of Policy-Aware Differentially Private Algorithms
Design of Policy-Aware Differentially Private Algorithms Samuel Haney Due University Durham, NC, USA shaney@cs.ue.eu Ashwin Machanavajjhala Due University Durham, NC, USA ashwin@cs.ue.eu Bolin Ding Microsoft
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationOn Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation
On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationAPPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly
International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -
More informationOn the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems
On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
More informationEFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER
FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationVariable Independence and Resolution Paths for Quantified Boolean Formulas
Variable Inepenence an Resolution Paths for Quantifie Boolean Formulas Allen Van Geler http://www.cse.ucsc.eu/ avg University of California, Santa Cruz Abstract. Variable inepenence in quantifie boolean
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationarxiv: v2 [math.co] 5 Jun 2018
Some useful lemmas on the ege Szege inex arxiv:1805.06578v [math.co] 5 Jun 018 Shengjie He 1 1. Department of Mathematics, Beijing Jiaotong University, Beijing, 100044, China Abstract The ege Szege inex
More information1 Surprises in high dimensions
1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic
More informationFrequent Pattern Mining. Frequent Item Set Mining. Overview. Frequent Item Set Mining: Motivation. Frequent Pattern Mining comprises
verview Frequent Pattern Mining comprises Frequent Pattern Mining hristian Borgelt School of omputer Science University of Konstanz Universitätsstraße, Konstanz, Germany christian.borgelt@uni-konstanz.e
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationNon-Uniform Sensor Deployment in Mobile Wireless Sensor Networks
01 01 01 01 01 00 01 01 Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University
More informationA Classification of 3R Orthogonal Manipulators by the Topology of their Workspace
A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.
More informationSocially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach
Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach Jian Zhao, Chuan Wu The University of Hong Kong {jzhao,cwu}@cs.hku.hk Abstract Peer-to-peer (P2P) technology is popularly
More informationA Versatile Model-Based Visibility Measure for Geometric Primitives
A Versatile Moel-Base Visibility Measure for Geometric Primitives Marc M. Ellenrieer 1,LarsKrüger 1, Dirk Stößel 2, an Marc Hanheie 2 1 DaimlerChrysler AG, Research & Technology, 89013 Ulm, Germany 2 Faculty
More informationImage compression predicated on recurrent iterated function systems
2n International Conference on Mathematics & Statistics 16-19 June, 2008, Athens, Greece Image compression preicate on recurrent iterate function systems Chol-Hui Yun *, Metzler W. a an Barski M. a * Faculty
More informationProving Vizing s Theorem with Rodin
Proving Vizing s Theorem with Roin Joachim Breitner March 25, 2011 Proofs for Vizing s Theorem t to be unwiely unless presente in form a constructive algorithm with a proof of its correctness an termination.
More informationPerformance Modelling of Necklace Hypercubes
erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract
More informationd 3 d 4 d d d d d d d d d d d 1 d d d d d d
Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching
More informationB-Splines and NURBS Week 5, Lecture 9
CS 430/585 Computer Graphics I B-Splines an NURBS Week 5, Lecture 9 Davi Breen, William Regli an Maxim Peysakhov Geometric an Intelligent Computing Laboratory Department of Computer Science Drexel University
More informationCMSC 430 Introduction to Compilers. Spring Register Allocation
CMSC 430 Introuction to Compilers Spring 2016 Register Allocation Introuction Change coe that uses an unoune set of virtual registers to coe that uses a finite set of actual regs For ytecoe targets, can
More informationConsidering bounds for approximation of 2 M to 3 N
Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationUninformed search methods
CS 1571 Introuction to AI Lecture 4 Uninforme search methos Milos Hauskrecht milos@cs.pitt.eu 539 Sennott Square Announcements Homework assignment 1 is out Due on Thursay, September 11, 014 before the
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationPolygon Simplification by Minimizing Convex Corners
Polygon Simplification by Minimizing Convex Corners Yeganeh Bahoo 1, Stephane Durocher 1, J. Mark Keil 2, Saee Mehrabi 3, Sahar Mehrpour 1, an Debajyoti Monal 1 1 Department of Computer Science, University
More informationClassical Mechanics Examples (Lagrange Multipliers)
Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5th International Conference on Avance Design an Manufacturing Engineering (ICADME 25) Research on motion characteristics an application of multi egree of freeom mechanism base on R-W metho Xiao-guang
More informationAdjacency Matrix Based Full-Text Indexing Models
1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,
More informationFigure 1: 2D arm. Figure 2: 2D arm with labelled angles
2D Kinematics Consier a robotic arm. We can sen it commans like, move that joint so it bens at an angle θ. Once we ve set each joint, that s all well an goo. More interesting, though, is the question of
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationThreshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides
Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita
More informationEvolutionary Optimisation Methods for Template Based Image Registration
Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South
More informationPAPER. 1. Introduction
IEICE TRANS. COMMUN., VOL. E9x-B, No.8 AUGUST 2010 PAPER Integrating Overlay Protocols for Proviing Autonomic Services in Mobile A-hoc Networks Panagiotis Gouvas, IEICE Stuent member, Anastasios Zafeiropoulos,,
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationAnimated Surface Pasting
Animate Surface Pasting Clara Tsang an Stephen Mann Computing Science Department University of Waterloo 200 University Ave W. Waterloo, Ontario Canaa N2L 3G1 e-mail: clftsang@cgl.uwaterloo.ca, smann@cgl.uwaterloo.ca
More informationProblem Paper Atoms Tree. atoms.pas. atoms.cpp. atoms.c. atoms.java. Time limit per test 1 second 1 second 2 seconds. Number of tests
! " # %$ & Overview Problem Paper Atoms Tree Shen Tian Harry Wiggins Carl Hultquist Program name paper.exe atoms.exe tree.exe Source name paper.pas atoms.pas tree.pas paper.cpp atoms.cpp tree.cpp paper.c
More informationA New Search Algorithm for Solving Symmetric Traveling Salesman Problem Based on Gravity
Worl Applie Sciences Journal 16 (10): 1387-1392, 2012 ISSN 1818-4952 IDOSI Publications, 2012 A New Search Algorithm for Solving Symmetric Traveling Salesman Problem Base on Gravity Aliasghar Rahmani Hosseinabai,
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing
More informationProvisioning Virtualized Cloud Services in IP/MPLS-over-EON Networks
Provisioning Virtualize Clou Services in IP/MPLS-over-EON Networks Pan Yi an Byrav Ramamurthy Department of Computer Science an Engineering, University of Nebraska-Lincoln Lincoln, Nebraska 68588 USA Email:
More information