435 search results - page 37 / 87 » Partitioning Search Spaces of a Randomized Search |
118
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
AUSAI
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
SIGSOFT
2009
ACM
15 years 10 months ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
128
click to vote
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
EC
2002
14 years 9 months ago
2002
In this paper, we develop techniques based on evolvability statistics of the fitness landscape surrounding sampled solutions. Averaging the measures over a sample of equal fitness...