2477 search results - page 38 / 496 » Approximate extended formulations |
TCBB
2010
13 years 8 months ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
SCAM
2006
IEEE
14 years 3 months ago
2006
IEEE
This paper addresses the question: “How can animated visualisation be used to express interesting properties of static analysis?” The particular focus is upon static dependenc...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
TCS
2008
13 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— Least-squares policy iteration is a useful reinforcement learning method in robotics due to its computational efficiency. However, it tends to be sensitive to outliers...