666 search results - page 119 / 134 » New primal-dual algorithms for Steiner tree problems |
SBIA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
SIGMOD
2011
ACM
12 years 12 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
IROS
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper presents a new method called Transition-based RRT (T-RRT) for path planning problems in continuous cost spaces. It combines the exploration strength of the RRT algorith...
FSTTCS
2003
Springer
14 years 2 months ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
DAC
1997
ACM
14 years 1 months ago
1997
ACM
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...