default search action
Annals of Mathematics and Artificial Intelligence, Volume 60
Volume 60, Numbers 1-2, October 2010
- Roberto Battiti, Bart Selman, Thomas Stützle:
Special issue on learning and intelligent optimization. 1-2 - Olivier Caelen, Gianluca Bontempi:
A dynamic programming strategy to balance exploration and exploitation in the bandit problem. 3-24 - Álvaro Fialho, Luís Da Costa, Marc Schoenauer, Michèle Sebag:
Analyzing bandit-based adaptive operator selection mechanisms. 25-64 - Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown:
Tradeoffs in the empirical evaluation of competing algorithm designs. 65-89 - Xingjian Li, Susan L. Epstein:
Learning cluster-based structure to solve constraint satisfaction problems. 91-117 - Vasileios Vasilikos, Michail G. Lagoudakis:
Optimization of heuristic search using recursive algorithm selection and reinforcement learning. 119-151 - Alain Berro, Souad Larabi Marie-Sainte, Anne Ruiz-Gazen:
Genetic algorithms and particle swarm optimization for exploratory projection pursuit. 153-178
Volume 60, Numbers 3-4, December 2010
- Fabrizio Angiulli, Gianluigi Greco, Luigi Palopoli:
Detecting and repairing anomalous evolutions in noisy environments - Logic programming formalization and complexity results. 179-228 - Raja Muhammad Asif Zahoor, Junaid Ali Khan, Ijaz Mansoor Qureshi:
A new stochastic approach for solution of Riccati differential equation of fractional order. 229-250 - Enrique Miranda, Marco Zaffalon:
Notes on desirability and conditional lower previsions. 251-309 - Rina Azoulay-Schwartz, Daphna Dor-Shiffer:
The impact of available information on negotiation results. 311-340 - Yisong Wang, Jia-Huai You, Fangzhen Lin, Li-Yan Yuan, Mingyi Zhang:
Weight constraint programs with evaluable functions. 341-380
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.