1034 search results - page 54 / 207 » Competitive generalized auctions |
117
click to vote
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
119
Voted
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, ...
97
Voted
COMPGEOM
1995
ACM
15 years 4 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
285
click to vote
SIGCSE
2008
ACM
15 years 11 days ago
2008
ACM
Generating interest in specialized areas of Computer Science (CS) is one of the goals of the department of Computer and Information Science at Spelman College as with most departm...
148
Voted
WINE
2010
Springer
14 years 10 months ago
2010
Springer
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...