672 search results - page 69 / 135 » A General Solution to the Graph History Interaction Problem |
118
click to vote
AINA
2007
IEEE
15 years 7 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
101
Voted
COR
2010
15 years 20 days ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
92
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
120
click to vote
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
70
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...