Sciweavers

2168 search results - page 397 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
TEC
2012
195views Formal Methods» more  TEC 2012»
13 years 5 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
212
Voted
EPS
1998
Springer
15 years 6 months ago
Acquisition of General Adaptive Features by Evolution
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...
Dan Ashlock, John E. Mayfield
ML
1998
ACM
131views Machine Learning» more  ML 1998»
15 years 2 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
GIS
2007
ACM
16 years 3 months ago
A model for enriching trajectories with semantic geographical information
The collection of moving object data is becoming more and more common, and therefore there is an increasing need for the efficient analysis and knowledge extraction of these data ...
Alejandro A. Vaisman, Bart Kuijpers, Bart Moelans,...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 3 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira