7930 search results - page 77 / 1586 » Greedy in Approximation Algorithms |
192
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
229
click to vote
TKDE
2012
13 years 9 months ago
2012
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
181
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
125
click to vote
ALT
2002
Springer
16 years 3 months ago
2002
Springer
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
163
click to vote
EOR
2010
15 years 6 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...