12519 search results - page 284 / 2504 » Approximation Problems Categories |
181
click to vote
JDA
2008
15 years 6 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
195
click to vote
OL
2010
15 years 1 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
166
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
190
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
243
click to vote
ICTAI
2003
IEEE
15 years 12 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...