1332 search results - page 181 / 267 » Combinatorial Algorithms |
RECOMB
2010
Springer
13 years 6 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
ALGORITHMICA
2011
13 years 3 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
TELSYS
2011
13 years 2 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We consider a wireless network comprising a number of mutuallyinterfering links. We study the transmit power control problem that determines the egalitarian signal-to-interference...
EMNLP
2011
12 years 7 months ago
2011
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...