7129 search results - page 326 / 1426 » Approximation Algorithms for Treewidth |
141
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
132
click to vote
DATE
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
126
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
126
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
127
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...