7930 search results - page 10 / 1586 » Greedy in Approximation Algorithms |
124
click to vote
MOBIHOC
2010
ACM
15 years 10 days ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
135
Voted
ANOR
2010
14 years 12 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
136
click to vote
WSC
2007
15 years 4 months ago
2007
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
122
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
160
click to vote
OL
2011
14 years 9 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...