Sciweavers

72 search results - page 6 / 15
» Colour Naming considering the Colour Variability Problem
Sort
View
ATAL
2008
Springer
15 years 28 days ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
82
Voted
COR
2010
123views more  COR 2010»
14 years 11 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
AAMAS
2011
Springer
14 years 6 months ago
Benchmarking hybrid algorithms for distributed constraint optimisation games
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
Archie C. Chapman, Alex Rogers, Nicholas R. Jennin...
83
Voted
DM
2008
127views more  DM 2008»
14 years 11 months ago
An adjacency lemma for critical multigraphs
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
David Cariolaro
98
Voted
DAM
2011
14 years 6 months ago
Powers of cycles, powers of paths, and distance graphs
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...