Stuart Chalmers

Stuart Chalmers

Auto-generated profile, based on publicly available information

Stuart Chalmers

University of Aberdeen

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2004 in Knowledge-Based Systems
Verified
Journal Article
Closed access
TNTimothy J Norman
Timothy J Norman
APAlun Preece
Alun Preece
SCStuart Chalmers
Stuart Chalmers
NJNicholas R Jennings
Nicholas R Jennings
MLMichael Luck
Michael Luck
NFNick J Fiddian
Nick J Fiddian

1 December 2005 in Multiagent and Grid Systems
Verified
Journal Article
Open access
PDF file
JPJigar Patel
Jigar Patel
WTW.T. Luke Teacy
W.T. Luke Teacy
NJNicholas R. Jennings
Nicholas R. Jennings
MLMichael Luck
Michael Luck
SCStuart Chalmers
Stuart Chalmers
STSimon Thompson
Simon Thompson
The ability to create reliable and scalable virtual organisations (VOs) on demand in a dynamic, open and competitive environment is one of the major challenges that underlie Grid computing. In response, in the CONOISE-G project, we are developing an

18 February 2010 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MJMatthew P. Johnson
Matthew P. Johnson
HRHosam Rowaihy
Hosam Rowaihy
DPDiego Pizzocaro
Diego Pizzocaro
ABAmotz Bar-Noy
Amotz Bar-Noy
SCStuart Chalmers
Stuart Chalmers
APAlune Preece
Alune Preece
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. In the most general setting, the problems we study are NP-hard even to approximate, and so we focus on heuristic algorithms that perform well in practice. In the static setting, we propose a greedy centralized solution and a more sophisticated solution that uses the Generalized Assignment Problem model and can be implemented in a distributed fashion. In what we call the dynamic setting, missions arrive over time and have different durations. For this setting, we give heuristic algorithms in which available sensors propose to nearby missions as they arrive. We find that the overall performance can be significantly improved if available sensors sometimes refuse to offer utility to missions they could help, making this decision based on the value of the mission, the sensor's remaining energy, and (if known) the remaining target lifetime of the network. Finally, we evaluate our solutions through simulations.

1 January 2004
Verified
Book Chapter
Closed access
PDF file
TNTimothy J. Norman
Timothy J. Norman
APAlun Preece
Alun Preece
SCStuart Chalmers
Stuart Chalmers
NJNicholas R. Jennings
Nicholas R. Jennings
MLMichael Luck
Michael Luck
NFNick J. Fiddian
Nick J. Fiddian

1 January 2008
Verified
Book Chapter
Closed access
PDF file
MJMatthew P. Johnson
Matthew P. Johnson
HRHosam Rowaihy
Hosam Rowaihy
DPDiego Pizzocaro
Diego Pizzocaro
ABAmotz Bar-Noy
Amotz Bar-Noy
SCStuart Chalmers
Stuart Chalmers
APAlun Preece
Alun Preece

1 January 2004 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
KHKit-Ying Hui
Kit-Ying Hui
SCStuart Chalmers
Stuart Chalmers
PGPeter M. D. Gray
Peter M. D. Gray
APAlun D. Preece
Alun D. Preece