Autonomous Search
Decades of innovations in combinatorial problem solving have produced better and more complex algorithms. These new methods are better since they can solve larger problems and address new application domains. They are also more complex which means that they are hard to reproduce and often harder to...
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
---|---|
Άλλοι συγγραφείς: | Hamadi, Youssef (Επιμελητής έκδοσης), Monfroy, Eric (Επιμελητής έκδοσης), Saubion, Frédéric (Επιμελητής έκδοσης) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2012.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Introduction to Learning Classifier Systems
ανά: Urbanowicz, Ryan J., κ.ά.
Έκδοση: (2017) -
The Path to Autonomous Robots Essays in Honor of George A. Bekey /
Έκδοση: (2009) -
Combinatorial Search: From Algorithms to Systems
ανά: Hamadi, Youssef
Έκδοση: (2013) -
Stability Analysis of Fuzzy-Model-Based Control Systems Linear-Matrix-Inequality Approach /
ανά: Lam, Hak-Keung, κ.ά.
Έκδοση: (2010) -
A Concise Introduction to Decentralized POMDPs
ανά: Oliehoek, Frans A., κ.ά.
Έκδοση: (2016)