Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Kamil Krynicki"'
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
The ever-increasing cases of acquired brain injury (ABI), especially among young people, have prompted a rapid progress in research involving neurological disorders. One important path is the concept of relearning, which attempts to help people regai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff4793bcf1bc2a45655087df92ab7fbe
https://doi.org/10.1016/j.asoc.2016.04.039
https://doi.org/10.1016/j.asoc.2016.04.039
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
Ant Colony Optimization is a bio-inspired computational technique for establishing optimal paths in graphs. It has been successfully adapted to solve many classical computational problems, with considerable results. Nevertheless, the attempts to appl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7834172e0efbddabfa9082bdffdc1df1
https://doi.org/10.1016/j.knosys.2016.05.009
https://doi.org/10.1016/j.knosys.2016.05.009
Autor:
Javier Jaen, Kamil Krynicki
Publikováno v:
Nature-Inspired Computing and Optimization ISBN: 9783319509198
In this chapter, we discuss the issues related to the problem of semantic resource querying in dynamic p2p environments and present the current approximations and successful solutions, with a special emphasis on their scalability. We focus on the use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ee2feb4331859425bbf9780d8b6ff09
https://doi.org/10.1007/978-3-319-50920-4_11
https://doi.org/10.1007/978-3-319-50920-4_11
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
Over the recent years peer-to-peer (p2p) systems have become increasingly popular. As of today most ofthe internet IP traffic is already transmitted in this format and still it is said to double in volume till 2014.Most p2p systems, however, are not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b7623cc18fcc05046429df1e353895c
https://doi.org/10.1016/j.asoc.2013.07.022
https://doi.org/10.1016/j.asoc.2013.07.022
Autor:
Kamil Krynicki
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
[EN] The long-lasting trend in the field of computation of stress and resource distribution has found its way into computer networks via the concept of peer-to-peer (P2P) connectivity. P2P is a symmetrical model, where each network node is enabled a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d49b63d94e1cc0b0c1205c39b136c65b
Autor:
Javier Jaen, Jose A. Mocholi, Alejandro Catala, Alejandro Cadenas, Artzai Picon, Kamil Krynicki
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
Modern technology has brought many changes to our everyday lives. Our need to be in constant touch with others has been met with the cellphone, which has become our companion and the convergence point of many technological advances. The combination o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc471b30c8305f866ae8b226085e4f2c
https://doi.org/10.1016/j.asoc.2012.05.010
https://doi.org/10.1016/j.asoc.2012.05.010
Publikováno v:
SMC
Ant Colony Optimization has proven to be an important optimization technique. It has provided a solid base for solving classical computational problems, networks routing problems and many others. Nonetheless, algorithms within the Ant Colony metaheur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da11c287a98460ccd9f2d61b54f4bf01
https://doi.org/10.1109/smc.2015.300
https://doi.org/10.1109/smc.2015.300
Autor:
Javier Jaen, Kamil Krynicki
Publikováno v:
GECCO (Companion)
Ant Colony Optimization (ACO) has become a popular metaheuristic approach for solving hard combinatorial optimization problems. However, most existing ACO software systems are domain-specific, dedicated to concrete problems or non-extensible, non-por
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39bd1d06c2165bf7f0ea598876ff9db1
https://doi.org/10.1145/2739482.2768464
https://doi.org/10.1145/2739482.2768464
Publikováno v:
IEEE Congress on Evolutionary Computation
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
The Ant Colony Optimization (ACO) has been a very resourceful metaheuristic over the past decade and it has been successfully used to approximately solve many static NP-Hard problems. There is a limit, however, of its applicability in the field of p2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a73050cb066f928d90265d0d4f83caab
https://doi.org/10.1109/cec.2013.6557658
https://doi.org/10.1109/cec.2013.6557658
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
Ubiquitous Computing and Ambient Intelligence ISBN: 9783642353765
UCAmI
instname
Ubiquitous Computing and Ambient Intelligence ISBN: 9783642353765
UCAmI
In this paper we present our research to extend a recommender system based on a semantic multicriteria ant colony algorithm to allow the use of Allen temporal operators. The system utilizes user’s learnt routes, including their associated context i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da340e6c46a8a1918791b60dbd00978d
https://doi.org/10.1007/978-3-642-35377-2_35
https://doi.org/10.1007/978-3-642-35377-2_35