1949 search results - page 323 / 390 » Random graphs on surfaces |
113
click to vote
VMV
2008
15 years 1 months ago
2008
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
108
click to vote
IJCAI
2003
15 years 1 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
122
click to vote
HICSS
2008
IEEE
15 years 1 days ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
AUTOMATICA
2006
14 years 12 months ago
2006
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-...
CN
2006
14 years 12 months ago
2006
We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The ag...