default search action
Artificial Intelligence Review, Volume 33
Volume 33, Numbers 1-2, February 2010
- Lior Rokach:
Ensemble-based classifiers. 1-39 - Yousef Kilani:
Improving GASAT by replacing tabu search by DLM and enhancing the best members. 41-59 - Ferrante Neri, Ville Tirronen:
Recent advances in differential evolution: a survey and experimental analysis. 61-106 - Liang Chen, Naoyuki Tokuda:
A unified framework for improving the accuracy of all holistic face identification algorithms. 107-122 - Christopher MacLeod, Niccolo Capanni:
Artificial biochemical networks: a different connectionist paradigm. 123-134 - Toshinori Munakata, Roman Barták:
Logic programming for combinatorial problems. 135-150 - Christian Bitter, David A. Elizondo, Yingjie Yang:
Natural language processing: a prolog perspective. 151-173
Volume 33, Number 3, March 2010
- R. A. Gupta, Rajesh Kumar, Ajay Kumar Bansal:
Artificial intelligence applications in Permanent Magnet Brushless DC motor drives. 175-186 - Aleksandra Klasnja-Milicevic, Alexandros Nanopoulos, Mirjana Ivanovic:
Social tagging in recommender systems: a survey of the state-of-the-art and possible extensions. 187-209 - Jamal Bentahar, Bernard Moulin, Micheline Bélanger:
A taxonomy of argumentation models used for knowledge representation. 211-259 - M. A. Balafar, Abdul Rahman Ramli, M. Iqbal Saripan, Syamsiah Mashohor:
Review of brain MRI image segmentation methods. 261-274
Volume 33, Number 4, April 2010
- David F. Nettleton, Albert Orriols-Puig, Albert Fornells:
A study of the effect of different types of noise on the precision of supervised learning techniques. 275-306 - Rahul Kala, Anupam Shukla, Ritu Tiwari:
Fusion of probabilistic A* algorithm and fuzzy inference system for robotic path planning. 307-327
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.