Zobrazeno 1 - 10
of 18
pro vyhledávání: '"James Trimble"'
Publikováno v:
ISPRS International Journal of Geo-Information, Vol 3, Iss 2, Pp 408-429 (2014)
While sea level rise is a world-wide phenomenon, mitigating its impacts is a local decision-making challenge that is going to require site-specific remedies. Faced with a variety of conflicting mandates and uncertainty as to appropriate responses, lo
Externí odkaz:
https://doaj.org/article/3ddfce8a2bc7478a8bb7b511e235d3ed
Publikováno v:
Graph Transformation
Graph Transformation ISBN: 9783030513719
ICGT
Graph Transformation ISBN: 9783030513719
ICGT
The Glasgow Subgraph Solver provides an implementation of state of the art algorithms for subgraph isomorphism problems. It combines constraint programming concepts with a variety of strong but fast domain-specific search and inference techniques, an
Publikováno v:
ICERI2021 Proceedings.
Autor:
Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David Manlove, William Pettersson, James Trimble
Publikováno v:
Computers and Operations Research, 141:105707. Elsevier Limited
Delorme, M, Garcia, S, Gondzio, J, Kalcsics, J, Manlove, D, Pettersson, W & Trimble, J 2022, ' Improved instance generation for kidney exchange programmes ', Computers and Operations Research, vol. 141, 105707 . https://doi.org/10.1016/j.cor.2022.105707
Delorme, M, Garcia, S, Gondzio, J, Kalcsics, J, Manlove, D, Pettersson, W & Trimble, J 2022, ' Improved instance generation for kidney exchange programmes ', Computers and Operations Research, vol. 141, 105707 . https://doi.org/10.1016/j.cor.2022.105707
Kidney exchange programmes increase the rate of living donor kidney transplants, and operations research techniques are vital to such programmes. These techniques, as well as changes to policy regarding kidney exchange programmes, are often tested us
Publikováno v:
ICERI Proceedings.
Autor:
Patrick Prosser, Ciaran McCreesh, James Trimble, Stephan Gocht, Jakob Nordström, Ross McBride
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030584740
CP
Gocht, S, McBride, R, McCreesh, C, Nordström, J, Prosser, P & Trimble, J 2020, Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems . in H Simonis (ed.), Principles and Practice of Constraint Programming : 26th International Conference, CP 2020, Proceedings . Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12333 LNCS, pp. 338-357, 26th International Conference on Principles and Practice of Constraint Programming, CP 2020, Louvain-la-Neuve, Belgium, 07/09/2020 . https://doi.org/10.1007/978-3-030-58475-7_20
CP
Gocht, S, McBride, R, McCreesh, C, Nordström, J, Prosser, P & Trimble, J 2020, Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems . in H Simonis (ed.), Principles and Practice of Constraint Programming : 26th International Conference, CP 2020, Proceedings . Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12333 LNCS, pp. 338-357, 26th International Conference on Principles and Practice of Constraint Programming, CP 2020, Louvain-la-Neuve, Belgium, 07/09/2020 . https://doi.org/10.1007/978-3-030-58475-7_20
An algorithm is said to be certifying if it outputs, together with a solution to the problem it solves, a proof that this solution is correct. We explain how state of the art maximum clique, maximum weighted clique, maximal clique enumeration and max
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02758b014059f549a17bd4d5253052e8
https://eprints.gla.ac.uk/221064/7/221064.pdf
https://eprints.gla.ac.uk/221064/7/221064.pdf
Publikováno v:
2019 IEEE National Aerospace and Electronics Conference (NAECON).
Algebraic connectivity is the second-smallest eigenvalue of the Laplacian matrix and can be used as a metric for the communication robustness of a network of agents. This connectivity concept applies to teams of multiple unmanned aerial vehicles (UAV
Publikováno v:
2019 International Conference on Unmanned Aircraft Systems (ICUAS).
Algebraic connectivity is the second-smallest eigenvalue of the Laplacian matrix and can be used as a metric for the robustness and efficiency of a network. This connectivity concept applies to teams of multiple unmanned aerial vehicles (UAVs) perfor
Autor:
James Trimble, Blair Archibald, Ruth Hoffmann, Fraser Dunlop, Ciaran McCreesh, Patrick Prosser
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030192112
CPAIOR
CPAIOR
Funding: This work was supported by the Engineering and Physical Sciences Research Council (grant numbers EP/P026842/1, EP/M508056/1, and EP/N007565). The current state of the art in subgraph isomorphism solving involves using degree as a value-order
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d490ccff00fe16ce25f924a30f22903
https://eprints.gla.ac.uk/180906/7/180906.pdf
https://eprints.gla.ac.uk/180906/7/180906.pdf
Publikováno v:
CCWC
The communication links shared among a team of Unmanned Aerial Vehicles (UAVs) can be represented as a Laplacian matrix. The second smallest eigenvalue of the matrix, known as algebraic connectivity, is a metric typically used to measure the connecti