The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This work proposes an adaptive routing scheme based on ant optimization techniques and novel graph-based waveband assignment algorithm to accommodate and group online lightpath requests while minimizing the blocking and resources usages in WDM networks.
This paper presents an Ant Colony Optimization Approach (ACO) to solve the shortest path problem, especially with fuzzy constraints. The proposed algorithm consists of five sequential steps. The first step is to determine the number of possible paths from the source to the target. The second step calculates the probability of each path of possible paths. The third step calculates the expected number...
This study investigates finding a fuzzy shortest path based on interval-valued fuzzy numbers and signed distance ranking defuzzification method. In this problem, we consider each edge weight of the network as unknown, which means that the precise value for each edge weight is not known at all, but some sample data are available. We propose an approach to combine statistics with fuzzy sets and then...
This paper proposes a method for the stabilization of vehicle formations in the plane under a fixed, but not necessarily complete, sensing graph. In this method each agent acts to minimize a local alignment error function that measures the difference between the desired relative formation of the agent and its neighbors (as determined by a sensing graph) and their current positions. It is shown that...
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereby provide a computational method for predicting binding sites for protein interaction. In this paper, we adopt a motif-driven approach where the support of candidate motif pairs is evaluated in the network. We experimentally...
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct temporal causal graphical models. However, how to best understand and conceptualize these complicated causal relationships is still an open problem. In this paper, we propose a decomposition approach to simplify the temporal...
For scale-free networks, traffic flow moving freely on a complex network is important to its normal and efficient functioning. In order to enhance the network efficiency, for a capacity-limited network, in this paper, we propose a new distribution algorithm by introducing an adjustable parameter ?? to control and distribute the delivery capacity of single node dynamically. The simulations reveal that...
Optimal design with the production cost of the manufacturing technology is carried out by the Dijkstra algorithm, the best processing lines and the relevant technological methods with condition of the lowest production cost are obtained. Practical instance with CAD procedure is given.
In this paper, a solution is proposed for n-Queen problem based on ACO (ant colony optimization). The n-Queen problem become intractable for large values of `n' and thus placed in NP (non-deterministic polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard...
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. This binary graph structure is obtained by reformulating the inference problem as a generalization of the polynomial time combinatorial optimization known as b-matching. Standard b-matching recovers a constant-degree constrained...
Efficient task scheduling, as a crucial step to achieve high performance for multiprocessor platform, remains one of the challenge problems despite of numerous studies. This paper presents a novel scheduling algorithm based on Bayesian optimization algorithm (BOA) for heterogeneous computing environment. In the proposed algorithm, BOA constructs and updates Bayesian network according to the task graph...
This paper presents a sequential image stitching approach for creating high-quality panoramic images on mobile devices. In this approach, each source image in the image sequence is stitched onto the panoramic image sequentially using two operations: optimal seam finding and transition smoothing. In the seam finding process, graph cut optimization finds an optimal seam and creates labeling in the overlapping...
In this paper, we consider optimization and identification problems in a non-equilibrium dynamic game. To be precise, we consider infinitely repeated games between a human and a machine based on the standard prisoners' dilemma model. The machine's strategy is assumed to be fixed with k-step memory, which may be unknown to the human. By analyzing the state transfer graph, it will be shown that the...
It is well known that reasoning with AI temporal projection problems is difficult. Determining the Possible Truth problem, a basic temporal projection decision problem, in the so-called Simple Event System remains NP-complete. In this paper, two types of constraints, on the graph-theoretic representation of the cause-and-effect relationships between events and on the partial orders of events, are...
This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques. For this purpose, a new move is introduced that permits us to perform better approximate optimizations. Some experiments show that very good local minima are obtained while keeping the memory usage low.
A discretized parametric curve can be seen as a sparse graph of vectors where each vertex is linked to two other vertices. Following this observation, we propose to generalize parametric active contours to a larger framework we call active vector graphs. This can be achieved by allowing each vertex of a graph of vectors to be linked to more than two vertices. An active graph does not need to be parameterized...
In this paper, we consider the feature correspondence task as a graph matching problem. Our approach tends to maximize a similarity objective function, which consists of not only the feature vectors but also their corresponding constrained global spatial structures, by a new polynomial-time approximate optimization algorithm. This algorithm allows every node in a smaller graph to potentially be linked...
Rate distortion optimization can significantly improve encoder performance in most video coding applications. Taking MPEG-2 as an example, this paper addresses the full rate distortion optimization for the first time by searching the product space of all four free parameters regardless of the computational complexity. An efficient graph-based searching algorithm was extended to the MPEG-2 video coding...
In this paper, we develop an efficient resource allocation algorithm for multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA) networks that considers all OFDM symbols in the current frame. By recognizing the special structure of the optimization problem, we develop an efficient algorithm based on graph theory that has a complexity independent of the number of OFDM...
This paper presents a performance study of two versions of a unidimensional search algorithm aimed at solving high-dimensional optimization problems. The algorithms were tested on 11 scalable benchmark problems. The aim is to observe how metaheuristics for continuous optimization problems respond with increasing dimension. To this end, we report the algorithms' performance on the 50, 100, 200 and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.