3874 search results - page 314 / 775 » Approximation Algorithms for k-hurdle Problems |
143
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
146
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
149
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
138
click to vote
CCIA
2005
Springer
15 years 10 months ago
2005
Springer
— This paper proposes a high-level Reinforcement Learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, whe...
173
Voted
EAAI
2010
15 years 3 months ago
2010
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...