435 search results - page 41 / 87 » Partitioning Search Spaces of a Randomized Search |
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
117
click to vote
ILP
2004
Springer
15 years 3 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
108
click to vote
ICDE
2012
IEEE
13 years 4 days ago
2012
IEEE
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
104
click to vote
ADC
2006
Springer
15 years 3 months ago
2006
Springer
Query answering over OWLs and RDFs on the Semantic Web is, in general, a deductive process. To this end, OWL, a family of web ontology languages based on description logic, has be...
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...