Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Korst, J.H.M."'
Autor:
Aarts, E.H.L., Horn, van der, P., Korst, J.H.M., Michiels, W.P.A.J., Sontrop, H., Alba, E., Marti, R.
Publikováno v:
Search Methodologies ISBN: 9781461469391
Handbook of approximation algorithms and metaheuristics, 25.1-25.11
STARTPAGE=25.1;ENDPAGE=25.11;TITLE=Handbook of approximation algorithms and metaheuristics
Search Methodologies : Introductory Tutorials in Optimization and Decision Support Techniques, 187-210
STARTPAGE=187;ENDPAGE=210;TITLE=Search Methodologies : Introductory Tutorials in Optimization and Decision Support Techniques
Search methodologies: introductory tutorials in optimization and decision support techniques, second edition, 265-286
STARTPAGE=265;ENDPAGE=286;TITLE=Search methodologies
Metaheuristic Procedures for Training Neutral Networks ISBN: 9780387334158
Chapman & Hall/CRC Computer & Information Science Series ISBN: 9781584885504
Metaheuristic procedures for training neural networks, 37-52
STARTPAGE=37;ENDPAGE=52;TITLE=Metaheuristic procedures for training neural networks
Local search in combinatorial optimization, 91-120
STARTPAGE=91;ENDPAGE=120;TITLE=Local search in combinatorial optimization
Handbook of approximation algorithms and metaheuristics, 25.1-25.11
STARTPAGE=25.1;ENDPAGE=25.11;TITLE=Handbook of approximation algorithms and metaheuristics
Search Methodologies : Introductory Tutorials in Optimization and Decision Support Techniques, 187-210
STARTPAGE=187;ENDPAGE=210;TITLE=Search Methodologies : Introductory Tutorials in Optimization and Decision Support Techniques
Search methodologies: introductory tutorials in optimization and decision support techniques, second edition, 265-286
STARTPAGE=265;ENDPAGE=286;TITLE=Search methodologies
Metaheuristic Procedures for Training Neutral Networks ISBN: 9780387334158
Chapman & Hall/CRC Computer & Information Science Series ISBN: 9781584885504
Metaheuristic procedures for training neural networks, 37-52
STARTPAGE=37;ENDPAGE=52;TITLE=Metaheuristic procedures for training neural networks
Local search in combinatorial optimization, 91-120
STARTPAGE=91;ENDPAGE=120;TITLE=Local search in combinatorial optimization
Simulated Annealing is a meta-heuristic that performs a randomized local search to reach near-optimal solutions of combinatorial as well as continuous optimization problems, In this chapter we show how it can be used to train artificial neural networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::680bb3b62a85d0f2d4bad58940d2f173
https://doi.org/10.1007/978-1-4614-6940-7_10
https://doi.org/10.1007/978-1-4614-6940-7_10
Autor:
Jovanovic, N., Korst, J.H.M., Aleksovski, Z., Michiels, W.P.A.J., Lukkien, J.J., Aarts, E.H.L.
Publikováno v:
Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, 89-94
STARTPAGE=89;ENDPAGE=94;TITLE=Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), Charlottetown, Prince Edward Island, Canada, August 8-10, 2012
STARTPAGE=89;ENDPAGE=94;TITLE=Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), Charlottetown, Prince Edward Island, Canada, August 8-10, 2012
Given a set of n non-overlapping unit disks in the plane, a line l is called blocked if it intersects at least one of the disks and a point p is called a shadow point if all lines containing p are blocked. In addition, a maximal closed set of shadow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::1644bfa05fa213b3d573e31a10dcc10b
https://research.tue.nl/nl/publications/ee977ab3-00d0-46da-af11-de7347ba8657
https://research.tue.nl/nl/publications/ee977ab3-00d0-46da-af11-de7347ba8657
Publikováno v:
Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010), 197-200
STARTPAGE=197;ENDPAGE=200;TITLE=Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010)
STARTPAGE=197;ENDPAGE=200;TITLE=Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010)
We consider the problem of blocking all rays emanating from a unit disk U by a minimum number N_d of unit disks in the two-dimensional space, where each disk has at least a distance d to any other disk. We study the asymptotic behavior of N_d, as d t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::e5075ad803fc38bd8a3c04bebc03e66f
https://research.tue.nl/nl/publications/58e7355a-354f-4a7a-a625-639bd95d56ff
https://research.tue.nl/nl/publications/58e7355a-354f-4a7a-a625-639bd95d56ff
Publikováno v:
Proceedings of the Fourth International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2010, Florence, Italy, October 25-30, 2010), 160-165
STARTPAGE=160;ENDPAGE=165;TITLE=Proceedings of the Fourth International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2010, Florence, Italy, October 25-30, 2010)
STARTPAGE=160;ENDPAGE=165;TITLE=Proceedings of the Fourth International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2010, Florence, Italy, October 25-30, 2010)
We consider the problem of blocking all rays emanating from a closed unit disk with a minimum number of closed unit disks in the two-dimensional space, where the minimum distance from a disk to any other disk is given. We study the asymptotic behavio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::86d839c69e886302849b06d24dcb66dd
https://research.tue.nl/nl/publications/b2cdbeb6-f5d4-4226-a20a-95e3f8e5f105
https://research.tue.nl/nl/publications/b2cdbeb6-f5d4-4226-a20a-95e3f8e5f105
Publikováno v:
Proceedings 20th Canadian Conference on Computational Geometry (CCCG'08, Montréal, Québec, Canada, August 13-15, 2008), 91-94
STARTPAGE=91;ENDPAGE=94;TITLE=Proceedings 20th Canadian Conference on Computational Geometry (CCCG'08, Montréal, Québec, Canada, August 13-15, 2008)
STARTPAGE=91;ENDPAGE=94;TITLE=Proceedings 20th Canadian Conference on Computational Geometry (CCCG'08, Montréal, Québec, Canada, August 13-15, 2008)
A circle C is occluded by a set of circles C1; : : : ;Cn if every line that intersects C also intersects at least one of the Ci; i = 1; : : : ; n. In this paper, we focus on determining the minimum number of circles that occlude a given circle assumi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::472b8053b26b760d24b7ca5e34f41a55
https://research.tue.nl/nl/publications/a1defeaa-ec5f-4d45-ab30-e372929631d2
https://research.tue.nl/nl/publications/a1defeaa-ec5f-4d45-ab30-e372929631d2
Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::8061cbe82708bda74c7616fc0973f04d
https://research.tue.nl/nl/publications/6c3fac34-e11f-469e-a979-0c7f659413e3
https://research.tue.nl/nl/publications/6c3fac34-e11f-469e-a979-0c7f659413e3
Publikováno v:
True Visions : the emergence of ambient intelligence, 245-273
STARTPAGE=245;ENDPAGE=273;TITLE=True Visions : the emergence of ambient intelligence
True Visions ISBN: 9783540289722
STARTPAGE=245;ENDPAGE=273;TITLE=True Visions : the emergence of ambient intelligence
True Visions ISBN: 9783540289722
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::874c5e015e7a478695e24895ccb778aa
https://research.tue.nl/nl/publications/6034ab53-08d2-465a-bea0-2b2b243f1c0d
https://research.tue.nl/nl/publications/6034ab53-08d2-465a-bea0-2b2b243f1c0d
Publikováno v:
Telecommunications and Networking-ICT 2004 ISBN: 9783540225713
ICT
Telecommunications and Networking-ICT 2004 (Proceedings 11th International Conference on Telecommunications, Fortaleza, Brazil, August 1-6, 2004), 1337-1346
STARTPAGE=1337;ENDPAGE=1346;TITLE=Telecommunications and Networking-ICT 2004 (Proceedings 11th International Conference on Telecommunications, Fortaleza, Brazil, August 1-6, 2004)
ICT
Telecommunications and Networking-ICT 2004 (Proceedings 11th International Conference on Telecommunications, Fortaleza, Brazil, August 1-6, 2004), 1337-1346
STARTPAGE=1337;ENDPAGE=1346;TITLE=Telecommunications and Networking-ICT 2004 (Proceedings 11th International Conference on Telecommunications, Fortaleza, Brazil, August 1-6, 2004)
In an in-home digital network (IHDN) it may be expected that several variable-bit-rate streams (audio, video) run simultaneously over a shared communication device, e.g. a bus. The data supply and demand of most of these streams will not be exactly k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9dce47c0723ac80b94dac6da74732b22
https://doi.org/10.1007/978-3-540-27824-5_173
https://doi.org/10.1007/978-3-540-27824-5_173
Publikováno v:
Algorithms in Ambient Intelligence, 239-258
STARTPAGE=239;ENDPAGE=258;TITLE=Algorithms in Ambient Intelligence
STARTPAGE=239;ENDPAGE=258;TITLE=Algorithms in Ambient Intelligence
To reduce the peak bit-rate for transmitting a variable-bit-rate stream, one can prefetch and buffer data at the receiving side. Previous work shows how to minimize the required buffer size given the available bandwidth [Feng, 19971 and how to minimi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::d9e17fc809502c19d12321f14ab0b364
https://research.tue.nl/nl/publications/b29a34c4-6b4e-4d50-80ec-cf591c294639
https://research.tue.nl/nl/publications/b29a34c4-6b4e-4d50-80ec-cf591c294639