2168 search results - page 298 / 434 » Randomized Algorithms and Complexity Theory |
178
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
150
Voted
MOBICOM
2012
ACM
13 years 5 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
147
click to vote
FCCM
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
101
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Component-based detection methods have demonstrated their promise by integrating a set of part-detectors to deal with large appearance variations of the target. However, an essent...