Cargando…
Autonomous search
Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.
Autores principales: | Hamadi, Youssef, Monfroy, Eric, Saubion, Frédéric |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2012
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2278729 |
Ejemplares similares
-
*-autonomous categories
por: Barr, Michael
Publicado: (1979) -
Bifurcation in autonomous and nonautonomous differential equations with discontinuities
por: Akhmet, Marat, et al.
Publicado: (2017) -
Mathematical programming solver based on local search
por: Gardi, Frédéric, et al.
Publicado: (2014) -
On the method of exact linearization of autonomous ordinary defferential equations
por: Berkovich, L M
Publicado: (2001) -
Attractors for infinite-dimensional non-autonomous dynamical systems
por: Carvalho, Alexandre N, et al.
Publicado: (2013)