982 search results - page 95 / 197 » Solving Steiner tree problems in graphs to optimality |
120
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Corner matching constitutes a fundamental vision problem that serves as a building block of several important applications. The common approach to dealing with this problem starts...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
124
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
111
Voted
ATMOS
2010
14 years 11 months ago
2010
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
129
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...