1331 search results - page 137 / 267 » Complexity bounds for zero-test algorithms |
ICNS
2007
IEEE
15 years 4 months ago
2007
IEEE
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...
ESA
2007
Springer
15 years 4 months ago
2007
Springer
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
IWPEC
2004
Springer
15 years 3 months 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...
105
click to vote
JAR
2007
14 years 10 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
TON
2002
14 years 9 months ago
2002
In this paper, we study the impact of heterogeneous receivers on the throughput of multicast flow control and propose a new multicast flow control algorithm to optimally partition ...