7930 search results - page 119 / 1586 » Greedy in Approximation Algorithms |
154
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...
163
click to vote
IDEAL
2007
Springer
16 years 14 days ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
176
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
165
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...