1554 search results - page 161 / 311 » Parameterized Complexity and Approximation Algorithms |
117
click to vote
JSS
2010
14 years 10 months ago
2010
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
146
Voted
JCC
2006
15 years 3 months ago
2006
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
143
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Uncertain data streams, where data is incomplete, imprecise, and even misleading, have been observed in many environments. Feeding such data streams to existing stream systems pro...
130
Voted
ML
2002
ACM
15 years 3 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
171
Voted
PPOPP
2011
ACM
14 years 6 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...