5606 search results - page 806 / 1122 » Randomization Techniques for Graphs. |
176
Voted
SENSYS
2004
ACM
16 years 4 days ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...
181
click to vote
APN
2004
Springer
16 years 4 days ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
205
click to vote
GI
2004
Springer
16 years 3 days ago
2004
Springer
: We present our idea of solving parts of the vision task with an organic computing approach. We have designed a multiagent system (MAS) of many different modules working on differ...
195
click to vote
ICCS
2004
Springer
16 years 3 days ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
194
click to vote
IWPEC
2004
Springer
16 years 2 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...