7930 search results - page 48 / 1586 » Greedy in Approximation Algorithms |
144
Voted
AAAI
2011
14 years 2 months ago
2011
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...
128
click to vote
SIROCCO
2001
15 years 3 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
125
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
105
click to vote
ALGOSENSORS
2007
Springer
15 years 8 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
131
click to vote
NIPS
1998
15 years 3 months ago
1998
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...