895 search results - page 38 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
NIPS
2007
15 years 6 days ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
ACL
2009
14 years 8 months ago
2009
Inspired by the incremental TER alignment, we re-designed the Indirect HMM (IHMM) alignment, which is one of the best hypothesis alignment methods for conventional MT system combi...
CEC
2007
IEEE
15 years 5 months ago
2007
IEEE
— Recent large scale experiments have shown that the Normalized Information Distance, an algorithmic information measure, is among the best similarity metrics for melody classiï¬...
QSIC
2003
IEEE
15 years 4 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...