default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDApplied Intelligence, Volume 32, 2010
Volume 32, Number 1, February 2010
- Christian Wallenta, Jungwon Kim, Peter J. Bentley
, Stephen Hailes:
Detecting interest cache poisoning in sensor networks using an artificial immune algorithm. 1-26 - Byoung-Jun Park, Witold Pedrycz, Sung-Kwun Oh:
Polynomial-based radial basis function neural networks (P-RBF NNs) and their application to pattern classification. 27-46 - Rui Zhang, Cheng Wu:
A hybrid approach to large-scale job shop scheduling. 47-59 - Salem Benferhat, Jonathan Ben-Naim, Odile Papini, Éric Würbel:
An answer set programming encoding of Prioritized Removed Sets Revision: application to GIS. 60-87 - Chou-Yuan Lee, Zne-Jung Lee, Shih-Wei Lin, Kuo-Ching Ying:
An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. 88-95 - Sang-Moon Soak, Moon-Gu Jeon:
The property analysis of evolutionary algorithms applied to spanning tree problems. 96-121 - Erik Berglund:
Improved PLSOM algorithm. 122-130 - Ariel Monteserin, Analía Amandi:
Building user argumentative models. 131-145
Volume 32, Number 2, April 2010
- Ngoc Thanh Nguyen, Radoslaw P. Katarzyniak, Adam Janiak:
Special issue on applied intelligent information systems. 147 - Yasser F. O. Mohammad, Toyoaki Nishida:
Controlling gaze with an embodied interactive control architecture. 148-163 - Fernando José Mateus da Silva, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel A. Vega-Rodríguez:
AlineaGA - a genetic algorithm with local search optimization for multiple sequence alignment. 164-172 - Maciej Lawrynczuk:
Suboptimal nonlinear predictive control based on multivariable neural Hammerstein models. 173-192 - Tomasz Garbolino, Gregor Papa:
Genetic algorithm for test pattern generator design - Automatic evolution of circuits. 193-204 - Patrick Moratori, Sanja Petrovic, José Antonio Vázquez Rodríguez:
Integrating rush orders into existent schedules for a complex job shop problem. 205-215 - Hoang-Hon Trinh, Dae-Nyeon Kim, Kang-Hyun Jo:
Supervised training database for building recognition by using cross ratio invariance and SVD-based method. 216-230
Volume 32, Number 3, June 2010
- Chang Wook Ahn, Rudrapatna S. Ramakrishna:
A diversity preserving selection in multiobjective evolutionary algorithms. 231-248 - Jens Lehmann, Sebastian Bader, Pascal Hitzler:
Extracting reduced logic programs from artificial neural networks. 249-266 - Faraz Rasheed, Reda Alhajj:
STNR: A suffix tree based noise resilient algorithm for periodicity detection in time series databases. 267-278 - Alexandre Linhares, Horacio Hideki Yanasse:
Search intensity versus search diversity: a false trade off? 279-291 - Yongming Li, Xiaoping Zeng:
Multi-population co-genetic algorithm with double chain-like agents structure for parallel global numerical optimization. 292-310 - Pablo San Segundo, Diego Rodríguez-Losada, Fernando Matía, Ramón Galán:
Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver. 311-329 - Aluízio Fausto Ribeiro Araújo, Cícero Garrozi:
MulRoGA: A Multicast Routing Genetic Algorithm approach considering multiple objectives. 330-345 - Shaojie Qiao, Changjie Tang, Huidong Jin, Jing Peng, Darren Davis, Nan Han:
KISTCM: knowledge discovery system for traditional Chinese medicine. 346-363 - Suk Jun Lee, Jae Joon Ahn, Kyong Joo Oh, Tae Yoon Kim:
Using rough set to support investment strategies of real-time trading in futures market. 364-377
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.
last updated on 2026-08-22 01:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
