Zobrazeno 1 - 10
of 20
pro vyhledávání: '"N. M. Stephens"'
Publikováno v:
Anaesthesia. 74(5)
Rib fractures are associated with significant morbidity and mortality. Ultrasound-guided thoracic paravertebral catheter insertion has been described for the management of pain secondary to rib fractures. We conducted a retrospective observational st
Autor:
N. M. Stephens, D. Castelino
Publikováno v:
Annals of Operations Research. 86:259-270
This paper presents a surrogate constraint tabu thresholding (SCTT) implementationfor solving the frequency assignment problem. The frequency assignment problem is animportant combinatorial optimisation problem that arises in telecommunications. The
Publikováno v:
Annals of Operations Research. 63:301-319
This paper presents the application of a tabu search algorithm for solving the frequency assignment problem. This problem, known to be NP-hard, is to find an assignment of frequencies for a number of communication links, which satisfy various constra
Publikováno v:
Computer Networks and ISDN Systems. 27:887-896
In this paper we describe a project aimed at addressing the lack of teaching material in high performance computing. The Teaching and Learning Technology Programme involves producing courseware modules in hypertext format for students in computer sci
Publikováno v:
Molecular Simulation. 9:41-47
Diffusion limited aggregation (DLA) has proved very successful in modelling systems which display fractal characteristics, like viscous fingering. However, by nature, such simulations are very processor intensive, requiring large amounts of processor
Autor:
N. M. Stephens
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540164630
CRYPTO
CRYPTO
The purpose of this exposition is to explain the method due to H.W. Lenstra, Jr. [1] of determining a non-trivial factor, p, of a composite number, n. The method uses the theory of elliptic curves and has a n expected running time of L (p)√2 where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ef468659ddba03ca6057880cc5077a3
https://doi.org/10.1007/3-540-39799-x_30
https://doi.org/10.1007/3-540-39799-x_30
Autor:
K. Dorkofikis, N. M. Stephens
Publikováno v:
Artificial Neural Nets and Genetic Algorithms ISBN: 9783211830871
ICANNGA
ICANNGA
The frequency assignment problem belongs to the quite difficult to deal with class of NP (nondeterministic polynomial) - hard combinatorial optimization problems [3]. Its computational complexity directs researchers in the field at developing efficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfa3e643c43d6e0b11637c086ecd8031
https://doi.org/10.1007/978-3-7091-6492-1_69
https://doi.org/10.1007/978-3-7091-6492-1_69
Autor:
A. T. Potter, N. M. Stephens
Publikováno v:
Artificial Neural Nets and Genetic Algorithms ISBN: 9783211830871
ICANNGA
ICANNGA
The frequency assignment problem is a computationally hard problem with many applications including the mobile telephone industry and tactical communications. The problem may be modelled mathematically as a T-colouring problem for an undirected weigh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1901dfb9e800bf4474edc280a5f506bf
https://doi.org/10.1007/978-3-7091-6492-1_70
https://doi.org/10.1007/978-3-7091-6492-1_70
Autor:
Michael M. Atkinson, N. M. Stephens
Publikováno v:
Linear Algebra and its Applications. 27:1-8
The number of nonscalar multiplications required to evaluate a general family of bilinear forms is investigated. An upper bound is obtained which is about half that obtained from naive arguments. In certain cases the best possible upper bound is obta
Publikováno v:
Acta Arithmetica. 35:1-16