2796 search results - page 320 / 560 » The coolest path problem |
213
click to vote
EDBT
2012
ACM
13 years 9 months ago
2012
ACM
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
185
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
180
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
160
click to vote
COLT
2004
Springer
15 years 12 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
187
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...