4860 search results - page 41 / 972 » SNPs Problems, Complexity, and Algorithms |
126
click to vote
CP
1999
Springer
15 years 7 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
104
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
110
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...
117
click to vote
COCO
2000
Springer
15 years 6 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
166
click to vote
ENTCS
2002
15 years 2 months ago
2002
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...