Sciweavers

549 search results - page 40 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
ICPADS
1998
IEEE
15 years 2 months ago
An Optimal Routing Scheme for Multiple Broadcast
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Hua Lee
MFCS
2009
Springer
15 years 4 months ago
The Cost of Stability in Network Flow Games
The core of a cooperative game contains all stable distributions of a coalition’s gains among its members. However, some games have an empty core, with every distribution being ...
Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey...
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 3 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
IPPS
1998
IEEE
15 years 1 months ago
Multicasting and Broadcasting in Large WDM Networks
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
Weifa Liang, Hong Shen
ICRA
2003
IEEE
210views Robotics» more  ICRA 2003»
15 years 3 months ago
A truncated least squares approach to the detection of specular highlights in color images
— One of the most difficult aspects of dealing with illumination effects in computer vision is accounting for specularity in the images of real objects. The specular regions in ...
Jae Byung Park, Avinash C. Kak