895 search results - page 74 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
193
click to vote
CCA
2009
Springer
15 years 7 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
114
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
123
click to vote
CCCG
2007
15 years 4 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
118
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
130
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...