3471 search results - page 565 / 695 » Obstacle Numbers of Graphs |
158
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
173
click to vote
EPS
1998
Springer
15 years 10 months ago
1998
Springer
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
165
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...
200
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
145
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...