70 search results - page 7 / 14 » Optimal reconstruction might be hard |
106
click to vote
SENSYS
2010
ACM
14 years 7 months ago
2010
ACM
Many participatory sensing applications use data collected by participants to construct a public model of a system or phenomenon. For example, a health application might compute a...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
ICSM
2006
IEEE
15 years 3 months ago
2006
IEEE
The test case execution order affects the time at which the objectives of testing are met. If the objective is fault detection, an inappropriate execution order might reveal most ...
ANOR
2011
14 years 1 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...