2526 search results - page 189 / 506 » A New Algorithm for Answer Set Computation |
160
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
169
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
168
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
181
click to vote
WOB
2004
15 years 7 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
196
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...