2434 search results - page 326 / 487 » Algorithmic Randomness of Closed Sets |
103
Voted
ISICA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
132
Voted
3DPVT
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process...
104
Voted
FCT
2005
Springer
15 years 9 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
148
Voted
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
145
Voted
VTS
2003
IEEE
15 years 9 months ago
2003
IEEE
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...