Sciweavers

1185 search results - page 203 / 237
» The Equivalence of Sampling and Searching
Sort
View
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 7 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
AIEDAM
2000
134views more  AIEDAM 2000»
13 years 7 months ago
Adaptive enlargement of state spaces in evolutionary designing
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...
John S. Gero, Vladimir A. Kazakov
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 7 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
CORR
2002
Springer
121views Education» more  CORR 2002»
13 years 7 months ago
Answering Subcognitive Turing Test Questions: A Reply to French
Robert French has argued that a disembodied computer is incapable of passing a Turing Test that includes subcognitive questions. Subcognitive questions are designed to probe the n...
Peter D. Turney
GPEM
2000
121views more  GPEM 2000»
13 years 7 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang