Sciweavers

72 search results - page 4 / 15
» Colour Naming considering the Colour Variability Problem
Sort
View
ATAL
2010
Springer
13 years 9 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
ENTCS
2007
150views more  ENTCS 2007»
13 years 7 months ago
On the Expressiveness of Mobile Synchronizing Petri Nets
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a coll...
Fernando Rosa Velardo, David de Frutos-Escrig, Olg...
FCT
2009
Springer
14 years 2 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the authorā€™s knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
Andreas Goerdt
SIGPRO
2008
106views more  SIGPRO 2008»
13 years 7 months ago
Propagator-based methods for recursive subspace model identification
The problem of the online identification of multi-input multi-output (MIMO) state-space models in the framework of discrete-time subspace methods is considered in this paper. Seve...
Guillaume Mercère, Laurent Bako, Sté...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 8 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson