Results 1  10
of
2,889,695
An average case NPcomplete graph problem
 arXiv:cs.CC/0112001
"... NPcomplete problems should be hard on some instances but these may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard on averag ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
NPcomplete problems should be hard on some instances but these may be extremely rare. On generic instances many such problems, especially related to random graphs, have been proven easy. We show the intractability of random instances of a graph coloring problem: this graph problem is hard
NPComplete
"... this article, use of the term crossover (or mating) assumes that mutation is included unless otherwise noted. ..."
Abstract
 Add to MetaCart
this article, use of the term crossover (or mating) assumes that mutation is included unless otherwise noted.
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Some NPcomplete Geometric Problems
"... We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NPcomplete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NPhard i ..."
Abstract

Cited by 99 (1 self)
 Add to MetaCart
We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NPcomplete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NP
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Using Genetic Algorithms to Solve NPComplete Problems
, 1989
"... A strategy for using Genetic Algorithms (GAs) to solve NPcomplete problems is presented. The key aspect of the approach taken is to exploit the observation that, although all NPcomplete problems are equally difficult in a general computational sense, some have much better GA representations than o ..."
Abstract

Cited by 148 (5 self)
 Add to MetaCart
A strategy for using Genetic Algorithms (GAs) to solve NPcomplete problems is presented. The key aspect of the approach taken is to exploit the observation that, although all NPcomplete problems are equally difficult in a general computational sense, some have much better GA representations than
Learning Bayesian Networks is NPComplete
, 1996
"... Algorithms for learning Bayesian networks from data havetwo components: a scoring metric and a search procedure. The scoring metric computes a score reflecting the goodnessoffit of the structure to the data. The search procedure tries to identify network structures with high scores. Heckerman e ..."
Abstract

Cited by 225 (8 self)
 Add to MetaCart
relative posterior probability greater than a given constant is NPcomplete, when the BDe metric is used. 12.1
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional
Fast Planning Through Planning Graph Analysis
 ARTIFICIAL INTELLIGENCE
, 1995
"... We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid pla ..."
Abstract

Cited by 1165 (3 self)
 Add to MetaCart
We introduce a new approach to planning in STRIPSlike domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest possible partialorder plan, or states that no valid
Results 1  10
of
2,889,695