1092 search results - page 105 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
172
click to vote
ISAAC
2004
Springer
16 years 5 days ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
241
click to vote
AAAI
2004
15 years 8 months ago
2004
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
191
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
151
click to vote
DEXA
2008
Springer
15 years 8 months ago
2008
Springer
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
183
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...