805 search results - page 93 / 161 » Combinatorial optimization problems in self-assembly |
101
click to vote
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
173
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
113
click to vote
JMLR
2010
14 years 4 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
PAMI
2010
14 years 8 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
ISCC
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we study the problems of resource and performance management in channelized wireless networks. For identifying research issues systematically, we propose a research...