2446 search results - page 235 / 490 » Choiceless Polynomial Time |
COCOON
2010
Springer
13 years 12 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
FTCS
1997
13 years 9 months ago
1997
A common problem in the operation of mission critical control systems is that of determining the future value of a physical quantity based upon past measurements of it or of relat...
ECAI
1998
Springer
14 years 13 days ago
1998
Springer
The problem of minimally modifying a plan in response to changes in the specification of the planning problem has already been investigated in the literature. In this paper we cons...
COLT
1993
Springer
14 years 9 days ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
GD
1994
Springer
14 years 9 days ago
1994
Springer
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...