Result 1 to 20 from 220 total
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. (English)
Comput. Oper. Res. 39, No. 1, 54-63 (2012).
1
The min-conflict packing problem. (English)
Comput. Oper. Res. 39, No. 9, 2122-2132 (2012).
2
Metaheuristic traceability attack against SLMAP, an RFID lightweight authentication protocol. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 543-553 (2012).
3
Parallel hybrid genetic algorithms for solving Q3AP on computational grid. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 483-500 (2012).
4
Hybridization of genetic and quantum algorithm for gene selection and classification of microarray data. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 431-444 (2012).
5
Special issue: Nature inspired distributed computing (NIDISC). Selected papers based on the presentations at the 12th international workshop, Rome, Italy, May 23, 2009. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 403-553 (2012).
6
An adaptive hierarchical master-worker (AHMW) framework for grids-application to B\&B algorithms. (English)
J. Parallel Distrib. Comput. 72, No. 2, 120-131 (2012).
7
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (English)
Computers & OR 39, No. 1, 54-63 (2012).
8
GPU-based multi-start local search algorithms. (English)
Coello Coello, Carlos A. (ed.), Learning and intelligent optimization. 5th international conference, LION 5, Rome, Italy, January 17‒21, 2011. Selected papers. Berlin: Springer (ISBN 978-3-642-25565-6/pbk). Lecture Notes in Computer Science 6683, 321-335 (2011).
9
A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems. (English)
J. Parallel Distrib. Comput. 71, No. 11, 1497-1508 (2011).
10
Towards ParadisEO-MO-GPU: A framework for GPU-based local search metaheuristics. (English)
Cabestany, Joan (ed.) et al., Advances in computational intelligence. 11th international work-conference on artificial neural networks, IWANN 2011, Torremolinos-Málaga, Spain, June 8‒10, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-21500-1/pbk). Lecture Notes in Computer Science 6691, 401-408 (2011).
11
Flexible variable neighborhood search in dynamic vehicle routing. (English)
Di Chio, Cecilia (ed.) et al., Applications of evolutionary computation. EvoApplications 2011: EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, Torino, Italy, April 27‒29, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-20524-8/pbk). Lecture Notes in Computer Science 6624, 344-353 (2011).
12
GPU-based approaches for multiobjective local search algorithms. A case study: The flowshop scheduling problem. (English)
Merz, Peter (ed.) et al., Evolutionary computation in combinatorial optimization. 11th European conference, EvoCOP 2011, Torino, Italy, April 27‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20363-3/pbk). Lecture Notes in Computer Science 6622, 155-166 (2011).
13
Metaheuristics based de novo protein sequencing: A new approach. (English)
Appl. Soft. Comput. 11, No. 2, 2271-2278 (2011).
14
A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO. (English)
Eur. J. Oper. Res. 209, No. 2, 104-112 (2011).
15
A cooperative tree-based hybrid GA-B\&B approach for solving challenging permutation-based problems (English)
GECCO, 513-520 (2011).
16
Flexible variable neighborhood search in dynamic vehicle routing (English)
EvoApplications (1), 344-353 (2011).
17
GPU-based approaches for multiobjective local search algorithms. A case study: the flowshop scheduling problem (English)
EvoCOP, 155-166 (2011).
18
Fault-tolerant mechanism for hierarchical branch and bound algorithm (English)
IPDPS Workshops, 1806-1814 (2011).
19
Multi-environmental cooperative parallel metaheuristics for solving dynamic optimization problems (English)
IPDPS Workshops, 395-403 (2011).
20
Result 1 to 20 from 220 total
Start
Contact
Print
General Help
