Sciweavers

2911 search results - page 457 / 583
» A Logic of Graph Constraints
Sort
View
AUTOMATICA
2006
122views more  AUTOMATICA 2006»
15 years 22 days ago
Gibbs sampler-based coordination of autonomous swarms
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
Wei Xi, Xiaobo Tan, John S. Baras
103
Voted
IJMC
2006
84views more  IJMC 2006»
15 years 20 days ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
103
Voted
HEURISTICS
2002
155views more  HEURISTICS 2002»
15 years 14 days ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
112
Voted
IJDSN
2008
81views more  IJDSN 2008»
15 years 6 days ago
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...
116
Voted
JCS
2010
124views more  JCS 2010»
14 years 11 months ago
Verifying resource access control on mobile interactive devices
A model of resource access control is presented in which the access control to resources can employ user interaction to obtain the necessary permissions. This model is inspired by...
Frédéric Besson, Guillaume Dufay, Th...