411 search results - page 39 / 83 » A New Approach to the Rectilinear Steiner Tree Problem |
148
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
117
click to vote
ICANN
2010
Springer
15 years 3 months ago
2010
Springer
We propose a new approach for reinforcement learning in problems with continuous actions. Actions are sampled by means of a diffusion tree, which generates samples in the continuou...
113
click to vote
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
127
click to vote
EJC
2008
15 years 2 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
106
click to vote
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...