5606 search results - page 221 / 1122 » Randomization Techniques for Graphs. |
124
click to vote
ALGORITHMICA
2006
15 years 26 days ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
84
Voted
CORR
2007
Springer
15 years 23 days ago
2007
Springer
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signiï...
137
Voted
PERVASIVE
2008
Springer
15 years 22 days ago
2008
Springer
In energy constrained wireless sensor networks, energy conservation techniques are to be applied in order to maximize the system lifetime. We tackle the problem of increasing netw...
95
Voted
TCAD
2008
15 years 21 days ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...
107
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...