76 search results - page 8 / 16 » isaac 2005 |
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
ISPAN
2005
IEEE
14 years 3 months ago
2005
IEEE
A semi-dynamic system is presented that is capable of predicting the performance of parallel programs at runtime. The functionality given by the system allows for efficient handl...
ISAAC
2005
Springer
14 years 3 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...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are q...
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...