1729 search results - page 235 / 346 » Bound Graph Polysemy |
163
click to vote
SOFSEM
2007
Springer
16 years 7 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
149
Voted
WINE
2007
Springer
16 years 7 days ago
2007
Springer
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
163
click to vote
SYNASC
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
198
click to vote
PDCAT
2005
Springer
15 years 11 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
140
click to vote
DEBS
2003
ACM
15 years 11 months ago
2003
ACM
Publish/subscribe systems are successfully used to decouple distributed applications. However, their efficiency is closely tied to the topology of the underlying network, the desi...