Sciweavers

16 search results - page 3 / 4
» The no free lunch and realistic search algorithms
Sort
View
ICML
1994
IEEE
13 years 8 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
CEC
2010
IEEE
13 years 2 months ago
Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
Rammohan Mallipeddi, Ponnuthurai Nagaratnam Sugant...
GECCO
2006
Springer
140views Optimization» more  GECCO 2006»
13 years 9 months ago
A representational ecology for learning classifier systems
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
James A. R. Marshall, Tim Kovacs
PETRA
2010
ACM
13 years 9 months ago
Context-aware optimized information dissemination in large scale vehicular networks
Context-aware inter-vehicular communication is considered to be vital for inducing intelligence through the use of embedded computing devices inside vehicles. Vehicles in a scalab...
Yves Vanrompay, Ansar-Ul-Haque Yasar, Davy Preuven...
BIRTHDAY
2010
Springer
13 years 6 months ago
Inferring Loop Invariants Using Postconditions
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
Carlo A. Furia, Bertrand Meyer