For pt.I see Chunming Qiao and Dahai Xu, INFOCOM'02, p.302-11, (2002). This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for...
详细信息
ISBN:
(纸本)0769518567
For pt.I see Chunming Qiao and Dahai Xu, INFOCOM'02, p.302-11, (2002). This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, it is shown that a heuristic algorithm can also have better overall performance than its time-consuming, integer linear programming (ILP) based counterparts in the online case, which is non-intuitive. The proposed heuristic algorithm is useful for developing effective shared path (mesh) protection schemes that establish survivable connections in modern networks. The advantage of our heuristic algorithm over existing algorithms for finding a pair of link (or node) disjoint paths, active path (AP) and backup path (BP), comes from the following salient feature. It uses a so-called potential backup cost (PBC) function when selecting an AP in the first phase, in order to take into consideration the backup bandwidth needed by the corresponding BP yet to be chosen in the second phase. The PBC function is derived mathematically based on a rigorous statistical analysis of experimental data. While the use of PBC only requires partial aggregate information on existing connections and distributed control, it can also be applied even more effectively when complete information is available.
For a domain D, the ring Int(D) of integer-valued polynomials over D is atomic if D satisfies the ascending chain condition on principal ideals. However, even for a discrete valuation domain V, the ring IntR(V) of int...
详细信息
An improved transformational approach to the scheduling problem in high-level synthesis is described. Based on an existing approach called SALSA, it uses an extended move set and lower bounds on resource costs to quic...
详细信息
An improved transformational approach to the scheduling problem in high-level synthesis is described. Based on an existing approach called SALSA, it uses an extended move set and lower bounds on resource costs to quickly find high-quality schedules of data-oriented control-data flow graphs. Results show the ability to find high-quality schedules for difficult scheduling problems in small amounts of CPU time. Results show that in contrast to other approaches, execution times can actually decrease as schedule length increases.< >
In this paper, we present a model for extractive multi-document text summarization using a supervised learning approach. The model uses a convolutional neural networks (CNN) which is capable of learning sentence featu...
详细信息
ISBN:
(纸本)9781538653241;9781538653234
In this paper, we present a model for extractive multi-document text summarization using a supervised learning approach. The model uses a convolutional neural networks (CNN) which is capable of learning sentence features on its own for sentence ranking. This approach has been used in order to avoid the overhead of extracting features from sentences manually. integer linear programming (ILP) approach has been adopted for selecting sentences to generate the summary based on sentence ranks. This ILP model minimizes the redundancy in the generated summary. We have evaluated our proposed approach on the DUC 2007 dataset and its performance is found to be competitive or better in comparison with state-of-the-art systems.
Array contraction is an optimization that transforms array variables into scalar variables within a loop. While the opposite transformation, scalar expansion, is used for enabling parallelism (with a penalty in memory...
详细信息
Array contraction is an optimization that transforms array variables into scalar variables within a loop. While the opposite transformation, scalar expansion, is used for enabling parallelism (with a penalty in memory size), array contraction is used to save memory by removing temporary arrays and to increase locality. Several heuristics have already been proposed to perform array contraction through loop fusion and/or loop shifting, but thus far, the complexity of the problem was unknown, and no exact approach was available. In this paper, we prove two NP-complete results that characterize precisely the problem and we give a practical integer linear programming formulation to solve the problem exactly.
Executing complex and time-sensitive operations has become difficult due to the increased acceptance of Internet of Things (IoT) devices and IoT-generated big data, which can result in problems with power consumption ...
详细信息
For a simple, undirected, connected graph G, a function h : V (G) ->{0, 1, 2, 3} which satisfies the following conditions is called a total Roman {3}-dominating function (TR3DF) of G with weight h(V) = Sigma(p is a...
详细信息
For a simple, undirected, connected graph G, a function h : V (G) ->{0, 1, 2, 3} which satisfies the following conditions is called a total Roman {3}-dominating function (TR3DF) of G with weight h(V) = Sigma(p is an element of V)h(p): (C1) For every vertex u is an element of V if h(u) = 0, then u has m (m >= 1) neighbors such that whose sum is at least 3, and if h(u) = 1, then u has n (n >= 1) neighbors such that whose sum is at least 2. (C2) The subgraph induced by the set of vertices labeled one, two or three has no isolated vertices. For a graph G, the smallest possible weight of a TR3DF of G denoted gamma(t{R3})(G) is known as the total Roman{3}-domination number of G. The problem of determining gamma(t{R3})(G) of a graph G is called minimum total Roman {3}-domination problem (MTR3DP). In this paper, we show that the problem of deciding if G has a TR3DF of weight at most l for chordal graphs is NP-complete. We also show that MTR3DP is polynomial time solvable for bounded treewidth graphs, chain graphs and threshold graphs. We design a 3(ln(Delta-0.5)+1.5)-approximation algorithm for the MTR3DP and show that the same cannot have (1 - delta)ln|V | ratio approximation algorithm for any delta > 0 unless NP subset of DTIME(|V|(O(loglog |V |))). Next, we show that MTR3DP is APX-complete for graphs with Delta = 4. We also show that the domination and total Roman {3}-domination problems are not equivalent in computational complexity aspects. Finally, we present an integer linear programming formulation for MTR3DP.
Rule-based and optimization-based autonomous intersection management (AIM) policies have been evaluated against traditional signal controls in terms of intersection safety, efficiency and emission. As one of AIM polic...
详细信息
Rule-based and optimization-based autonomous intersection management (AIM) policies have been evaluated against traditional signal controls in terms of intersection safety, efficiency and emission. As one of AIM policies, reservation-based control has further taken advantage of the benefits of AIM, especially via optimization approaches. This paper presents a time-independent trajectory optimization approach for connected and autonomous vehicles under reservation-based intersection control. The existing approaches assign an arrival time and speed to vehicles ahead of entering the intersection. However, the vehicles may not follow the planned trajectory once the traffic condition varies sharply and thus the trajectory solution becomes infeasible with respect to the assigned arrival time and speed. The proposed approach aims to solve the fail-follow problem by separating the optimization between arrival time, speed, and trajectory planning by optimizing the trajectory without arrival time and speed predetermined. The approach finds the optimal solution in terms of the intersection efficiency meanwhile keeps the feasibility of trajectory planning by formulating the variation of acceleration rate and breaking a whole trajectory into an enlarged set of segments. Two different control strategies, BATCH and ZONE, are also proposed to test the performance of the optimization approach in comparison with another Dynamic Batch strategy. The results validate that the proposed approach can adapt to extremely high traffic demand scenario. Sensitivity analyses also evaluate the performance of the proposed approach under different problem settings in terms of intersection efficiency.
This work aims to improve an earlier methodology for assigning personnel to diverse three-member teams. Notably, the original algorithm focused only on diversity within teams, to ensure that conflicting interests are ...
详细信息
暂无评论