7930 search results - page 1462 / 1586 » Greedy in Approximation Algorithms |
148
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
115
click to vote
MP
2007
15 years 3 months ago
2007
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
166
Voted
PR
2008
15 years 3 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
143
click to vote
RSA
2008
15 years 3 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
159
click to vote
TEC
2008
15 years 3 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...