7930 search results - page 238 / 1586 » Greedy in Approximation Algorithms |
163
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tr...
204
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— Spectrum handoff occurs when the primary users appear in the licensed band occupied by the secondary users. Spectrum handoff procedures aim to help the secondary users to vacat...
184
click to vote
EUROCAST
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
195
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
The proposed method is related to parametric and geodesic active contours as well as minimal paths, in the context of image segmentation 1 . Our geodesically linked active contour ...
169
click to vote
EVOW
2007
Springer
16 years 21 days ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...