895 search results - page 133 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
CVPR
2007
IEEE
16 years 21 days ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
107
click to vote
CGO
2011
IEEE
14 years 2 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
DATE
2005
IEEE
15 years 4 months ago
2005
IEEE
The objective of this paper is to introduce dependability as an optimization criterion in the system-level design process of embedded systems. Given the pervasiveness of embedded ...
119
click to vote
BMCBI
2010
14 years 8 months ago
2010
Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
CPC
2006
14 years 10 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...