982 search results - page 72 / 197 » Solving Steiner tree problems in graphs to optimality |
108
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
103
click to vote
ESA
2000
Springer
15 years 4 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
103
Voted
NIPS
2004
15 years 2 months ago
2004
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...
98
Voted
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...