982 search results - page 101 / 197 » Solving Steiner tree problems in graphs to optimality |
149
click to vote
ICMCS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
177
Voted
HICSS
2003
IEEE
15 years 10 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
149
click to vote
COR
2008
15 years 4 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
142
click to vote
IJCAI
2003
15 years 6 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
161
click to vote
COR
2007
15 years 4 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...