1594 search results - page 282 / 319 » An Algorithm to Compute Collusion Paths |
110
click to vote
WIOPT
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
GD
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
81
Voted
WINE
2005
Springer
15 years 5 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
MM
2004
ACM
15 years 5 months ago
2004
ACM
This paper proposes a visual representation named scene tunnel to archive and visualize urban scenes for Internet based virtual tour. We scan cityscapes using multiple cameras on ...
IEEEPACT
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...