The paper presents a novel approach to the decentralized task assignment for multiple cooperative unmanned air systems, in a multiple target-multiple task environment. The vehicles (or agents) may have complete or partial a priori information about the targets that populate the scenario. Each vehicle autonomously computes the cost for servicing each task available at each target using a path pl...

A vertex (edge) coloring φ : V → {1, 2, . . . , t} (φ′ : E → {1, 2, . . . , t}) of a graph G = (V,E) is a vertex (edge) t-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number χr(G) (edge ranking number χ′ r (G)) is the smallest value of t such that G has a vertex (edge) t-ranking. In this paper we...

Recently, there is a surge of interests on heterogeneous information network analysis. Although evaluating the importance of objects has been well studied in homogeneous networks, it is not yet exploited in heterogeneous networks. In this paper, we study the ranking problem in heterogeneous networks and propose the HRank method to evaluate the importance of multiple types of objects and meta pa...

-Organizations need to work on productivity improvement in order to enhance their operational performances. A number of works have taken efforts in efficiency evaluation and ranking using analytic methods such as the data envelopment analysis (DEA). However, few works have highlighted the relationship among significant factors that affect productivity. Performing efficiency evaluation and ranki...

1 Supported in part by a grant from the Texas Advanced Research Program. Abstract-We consider the problem of finding an optimum path from each node in the network to a destination node in the network. Typically, each edge in the network is assigned a weight value (e.g. bandwidth or delay), and a metric function (e.g. min or +) is applied consecutively to the edges in the path. The result is the...

A vertex k-ranking of a graph G is a function c : V (G) → {1, . . . , k} such that if c(u) = c(v), u, v ∈ V (G) then each path connecting vertices u and v contains a vertex w with c(w) > c(u). If each vertex v has a list of integers L(v) and for a vertex ranking c it holds c(v) ∈ L(v) for each v ∈ V (G) then c is called L-list k-ranking, where L = {L(v) : v ∈ V (G)}. In this paper we investigat...

Constrained shortest path problem (CSPP) is an NPComplete problem where the goal is to determine the cheapest path bounded by a given delay constraint. This problem finds application in several fields like television and transportation networks, ATM circuit routing, multimedia applications etc. In these kinds of applications it is important to provide quality of service (QoS). Therefore, it is ...

Structural queries specify complex predicates on the content and the structure of the elements of tree-structured XML documents. Recent works have typically applied top-down decomposition of the twig patterns into (i) parent-child or ancestordescendant relationships, or (ii) path expression queries, and then followed by a join operation to reconstruct matched twig patterns. This demonstration s...