7522 search results - page 1505 / 1505 » Spacing memetic algorithms |
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...
ISCC
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...