Results 1  10
of
1,189
A polynomial time (heuristic) SAT algorithm
, 2002
"... ABSTRACT — [Note: See addendum prefacing this paper, as a hole has been determined to exist in the algorithm as presented in this paper.] An algorithm of two parts is presented that determines existence of and instance of an assignment satisfying of instances of SAT. The algorithm employs an unconve ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to the motivating basis from which Part A was derived. A reversion back to the more primitive and computationally expensive in the worst case is being composed. For now the algorithm as presented can be said to be no better than a polynomial time heuristic SAT algorithm. The algorithm has not been found to give
ModelDriven Data Acquisition in Sensor Networks
 IN VLDB
, 2004
"... Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor ..."
Abstract

Cited by 449 (36 self)
 Add to MetaCart
of our answer against the communication and data acquisition costs in the network. We describe an exponential time algorithm for finding the optimal solution to this optimization problem, and a polynomialtime heuristic for identifying solutions that perform well in practice. We evaluate our approach
Improved Steiner Tree Approximation in Graphs
, 2000
"... The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialtime heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously bestknown approximation ..."
Abstract

Cited by 225 (6 self)
 Add to MetaCart
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomialtime heuristic with an approximation ratio approaching 1 + 2 1:55, which improves upon the previously best
On the Performance of Polynomialtime CLIQUE
 In Cliques, Coloring, and Satisfiability: second DIMACS Implementation Challenge
, 1994
"... The performance of a randomized version of the subgraphexclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halld'orsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a ve ..."
Abstract
 Add to MetaCart
The performance of a randomized version of the subgraphexclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halld'orsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a
Selection of Views to Materialize in a Data Warehouse
, 1997
"... . A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decisionsupport or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The ..."
Abstract

Cited by 246 (5 self)
 Add to MetaCart
of selection of views in a data warehouse. We present competitive polynomialtime heuristics for selection of views to optimize total query response time, for some important special cases of the general data warehouse scenario, viz.: (i) an AND view graph, where each query/view has a unique evaluation, and (ii
Data reduction, exact, and heuristic algorithms for clique cover
 In Proceedings 8th Workshop on Algorithm Engineering and Experiments ALENEX’06
, 2006
"... To cover the edges of a graph with a minimum number of cliques is an NPcomplete problem with many applications. The stateoftheart solving algorithm is a polynomialtime heuristic from the 1970’s. We present an improvement of this heuristic. Our main contribution, however, is the development of e ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
To cover the edges of a graph with a minimum number of cliques is an NPcomplete problem with many applications. The stateoftheart solving algorithm is a polynomialtime heuristic from the 1970’s. We present an improvement of this heuristic. Our main contribution, however, is the development
Heuristics for Partitioning Parallel Applications on Virtual Multiprocessors
"... Abstract—The problem of partitioning a parallel application on a parallel machine optimizing the available resources has been proved to be NPhard in the strong sense. In this paper, we propose a polynomialtime heuristic algorithm for allocating a realtime application consisting of a set of tasks ..."
Abstract
 Add to MetaCart
Abstract—The problem of partitioning a parallel application on a parallel machine optimizing the available resources has been proved to be NPhard in the strong sense. In this paper, we propose a polynomialtime heuristic algorithm for allocating a realtime application consisting of a set of tasks
1+N protection in polynomial time: a heuristic approach
"... Abstract—The generalized 1+N protection [9], protects N unicast connections by a single Steiner tree connecting all end points of the connections. By sending network coded packets on the protection Steiner tree in parallel with the working traffic, 1+N is able to recover from any single link failure ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
circuit for the subset of connections in each partition. In this paper a polynomial time heuristic algorithm for 1+N protection is proposed which combines heuristic steps to address the three NPhard components of the problem. Our simulations show that the heuristic algorithm provides average cost
Twoprover oneround proof systems: their power and their problems (Extended Abstract)
 IN PROCEEDINGS OF THE TWENTYFOURTH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1992
"... We characterize the power of twoprover oneround (MI’P(2, 1)) proof systems, showing that M1P(2, 1) = NEXPTIME. However, the following intriguing question remains open: Does parallel repetition decrease the error probability y of MlP(2, 1) proof systems? We use techniques based on quadratic program ..."
Abstract

Cited by 110 (6 self)
 Add to MetaCart
programming to study this problem, and prove the parallel repetition conjecture in some special cases. Interestingly, our work leads to a general polynomial time heuristic for any NPproblem. We prove the effectiveness of this heuristic for several problems, such as computing the chromatic number of perfect
Two Heuristics for the Steiner Tree Problem
 JOURNAL OF GLOBAL OPTIMIZATION
, 1996
"... The Steiner tree problem is to find the tree with minimal Euclidean length spanning a set of fixed points in the plane, given the ability to add points (Steiner points). The problem is NPhard, so polynomialtime heuristics are desired. We present two such heuristics, both of which utilize an ef ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The Steiner tree problem is to find the tree with minimal Euclidean length spanning a set of fixed points in the plane, given the ability to add points (Steiner points). The problem is NPhard, so polynomialtime heuristics are desired. We present two such heuristics, both of which utilize
Results 1  10
of
1,189