982 search results - page 153 / 197 » Solving Steiner tree problems in graphs to optimality |
129
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
123
Voted
NETWORKING
2008
15 years 1 months ago
2008
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
101
Voted
PDPTA
2003
15 years 1 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
101
Voted
AAAI
2006
15 years 1 months ago
2006
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
107
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...