18306 search results - page 433 / 3662 » Algorithmics in Exponential Time |
207
click to vote
IJCAI
1989
15 years 8 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
171
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Environmental sequence datasets are increasing at an exponential rate; however, the vast majority of them lack appropriate descriptors like sampling location, time and...
190
Voted
JSAT
2006
15 years 7 months ago
2006
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the p...
161
click to vote
TIT
2002
15 years 7 months ago
2002
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
223
Voted
FUIN
2008
15 years 7 months ago
2008
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent ...