The 0/1 Multidimensional Knapsack Problem (0/1 MKP) is an interesting NP-hard
combinatorial optimization problem that can model a number of challenging applications in …

With the rapid growth of the number of web services on the Internet, various service
providers provide many similar services with the same function but different quality of service …

General solvers exist for several types of optimisation problems, with the commercially
available solvers for mixed integer programming (MIP) being a prime example. Although …

The aim of this research is to propose the two-stage model to select a set of failures that
need to be eliminated or reduced which leads to improved reliability and effectiveness of the …

Swarm intelligence algorithms gain more attention with ever growing computing capabilities
since they can provide diverse and useful solutions for ill-structured and complex problems …

摘要扩展Web 服务类型的组合方式, 实现服务的无缝组合和提高服务组合的可靠性是当今Web
服务组合的研究热点. 针对Web 服务类型组合方式多样性和无缝服务组合问题 …

NOVI MODELI I METODE ZA SELEKCIJU I KOMPOZICIJU WEB SERVISA NA OSNOVU
NEFUNKCIONALNIH KARAKTERISTIKA Page 1 UNIVERZITET U BEOGRADU FAKULTET …

With the rapid development of service computing and cloud computing, a tremendous
amount of available services which provide the same or similar functionality but differ in …

According to studies about bee swarms, they use special techniques for foraging and they
are always able to find notified food sources with exact coordinates. In order to succeed in …

Poslednjih godina sve veći broj novosintetisanih lekovitih supstanci su nisko rastvorljive u
vodi. Jedan od načina za povećanje brzine rastvaranja/rastvorljivosti lekovitih supstanci …