Results 1  10
of
927,538
Fast Heuristic Algorithm for Joint Topology Design and Load Balancing in FSO Networks
"... Abstract—We investigate the challenging problem of joint topology design and load balancing in FSO networks. Important factors such as FSO link characteristics, cost constraints, traffic characteristics, traffic demand, and QoS requirements are considered in the problem formulation, along with obje ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
with objective functions of networkwide average traffic load and delay. We develop a fast heuristic algorithm to provide highly competitive solutions. The heuristic algorithm iteratively perturbs the current topology and computes network flows for the new topology, thus progressively improving the configuration
A Fast Heuristic Algorithm for Disjoint Decomposition of Boolean Functions
 Proceedings of International Workshop on Logic Synthesis
, 2002
"... Abstract — This paper presents a heuristic algorithm for disjoint decomposition of a Boolean function based on its ROBDD representation. Two distinct features make the algorithm feasible for large functions. First, for an nvariable function, it checks only O(n 2) candidates for decomposition out of ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract — This paper presents a heuristic algorithm for disjoint decomposition of a Boolean function based on its ROBDD representation. Two distinct features make the algorithm feasible for large functions. First, for an nvariable function, it checks only O(n 2) candidates for decomposition out
A simple and fast heuristic algorithm for edgecoloring of graphs
 AKCE Int. J. Graphs Comb
"... A simple but empirically efficient heuristic algorithm for the edgecoloring of graphs is presented. Its basic idea is the displacement of “conflicts ” (repeated colors in the edges incident to a vertex) along paths of adjacent vertices whose incident edges are recolored by swapping alternating colo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A simple but empirically efficient heuristic algorithm for the edgecoloring of graphs is presented. Its basic idea is the displacement of “conflicts ” (repeated colors in the edges incident to a vertex) along paths of adjacent vertices whose incident edges are recolored by swapping alternating
A Fast Heuristic Algorithm for Minimizing Congestion in the MPLS Networks
, 2014
"... In the multiple protocol labelswitched (MPLS) networks, the commodities are transmitted by the labelswitched paths (LSPs). For the sake of reducing the total cost and strengthening the central management, the MPLS networks restrict the number of paths that a commodity can use, for maintaining the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
it and a heuristic algorithm which quickly finds transmitting paths for each commodity are also presented. In this paper, we propose a new heuristic algorithm which finds a feasible path set for each commodity, and then select some paths from the path set through a mixed integer linear programming
A Fast Heuristic Algorithm for Disjoint Decomposition of Boolean Functions
"... This paper presents a heuristic algorithm for disjoint decomposition of a Boolean function based on its ROBDD representation. Two distinct features make the algorithm feasible for large functions. First, for an nvariable function, it checks only O(n 2) candidates for decomposition out of O(2 n) pos ..."
Abstract
 Add to MetaCart
This paper presents a heuristic algorithm for disjoint decomposition of a Boolean function based on its ROBDD representation. Two distinct features make the algorithm feasible for large functions. First, for an nvariable function, it checks only O(n 2) candidates for decomposition out of O(2 n
A Fast Heuristic Algorithm for a Probe Mapping Problem
 In Proceedings of the Fifth International Conferenceon Intelligent Systems for Molecular Biology
, 1997
"... A new heuristic algorithm is presented for mapping probes to locations along the genome, given noisy pairwise distance data as input. The model considered is quite general: The input consists of a collection of probe pairs and a confidence interval for the genomic distance separating each pair ..."
Abstract
 Add to MetaCart
A new heuristic algorithm is presented for mapping probes to locations along the genome, given noisy pairwise distance data as input. The model considered is quite general: The input consists of a collection of probe pairs and a confidence interval for the genomic distance separating each
The FF planning system: Fast plan generation through heuristic search
 Journal of Artificial Intelligence Research
, 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract

Cited by 822 (53 self)
 Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts
Fast heuristic algorithm for threeblock decomposition of a system of weakly specified Boolean functions
"... Abstract — The paper presents an approach to decomposition of a system of weakly specified Boolean functions represented by a sumofproducts (SOP) into a netlist of logic blocks. The approach is based on a fast heuristic splitting of a weakly specified Boolean function into three interconnected mul ..."
Abstract
 Add to MetaCart
Abstract — The paper presents an approach to decomposition of a system of weakly specified Boolean functions represented by a sumofproducts (SOP) into a netlist of logic blocks. The approach is based on a fast heuristic splitting of a weakly specified Boolean function into three interconnected
A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem
"... A clique in an undirected graph G = (V, E) is a subset V ' ⊆ V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph. The clique problem is NPComplete. We have succeeded in developing a fast alg ..."
Abstract
 Add to MetaCart
only the remaining sub graphs. This heuristic algorithm runs in polynomial time and executes successfully for several examples when applied to random graphs and DIMACS benchmark graphs. 1.
Fast Algorithms for Mining Association Rules
, 1994
"... We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known a ..."
Abstract

Cited by 3551 (15 self)
 Add to MetaCart
We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known
Results 1  10
of
927,538