Malleable resource sharing algorithms for cooperative resolution of problems (2012)
- Authors:
- USP affiliated authors: LEJBMAN, ALFREDO GOLDMAN VEL - IME ; NGOKO, YANIK MARTIAL - IME
- Unidade: IME
- DOI: 10.1109/CEC.2012.6256524
- Subjects: ALGORITMOS; OTIMIZAÇÃO COMBINATÓRIA
- Keywords: algorithm portfolio; hyper-heuristics; resource sharing; cooperative problem solving
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2012
- Source:
- Título: Proceedings
- Conference titles: IEEE Congress on Evolutionary Computation - CEC
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
GOLDMAN, Alfredo e NGOKO, Yanik e TRYSTRAM, Denis. Malleable resource sharing algorithms for cooperative resolution of problems. 2012, Anais.. Piscataway: IEEE, 2012. Disponível em: https://doi.org/10.1109/CEC.2012.6256524. Acesso em: 03 jan. 2026. -
APA
Goldman, A., Ngoko, Y., & Trystram, D. (2012). Malleable resource sharing algorithms for cooperative resolution of problems. In Proceedings. Piscataway: IEEE. doi:10.1109/CEC.2012.6256524 -
NLM
Goldman A, Ngoko Y, Trystram D. Malleable resource sharing algorithms for cooperative resolution of problems [Internet]. Proceedings. 2012 ;[citado 2026 jan. 03 ] Available from: https://doi.org/10.1109/CEC.2012.6256524 -
Vancouver
Goldman A, Ngoko Y, Trystram D. Malleable resource sharing algorithms for cooperative resolution of problems [Internet]. Proceedings. 2012 ;[citado 2026 jan. 03 ] Available from: https://doi.org/10.1109/CEC.2012.6256524 - An analytical approach for predicting QoS of web services choreographies
- On graph reduction for QoS prediction of very large web service compositions
- A comparative study on task dependent scheduling algorithms for grid computing
- A model for parallel job schedulling on dynamical computer grids
- Exchanging messages of different sizes
- Combining parallel algorithms solving the same application: what is the best approach?
- Actor scheduling for multicore hierarchical memory platforms
- Scheduling with duplication on m processors with small communication delays
- A MILP approach to schedule parallel independent tasks
- A delay-tolerant network routing algorithm based on column generation
Informações sobre o DOI: 10.1109/CEC.2012.6256524 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
