4865 search results - page 550 / 973 » The Complexity of Graph Connectivity |
190
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
174
click to vote
MODELS
2009
Springer
16 years 1 months ago
2009
Springer
Recently, a generic approach for syntax-based user assistance in diagram editors has been proposed that requires the syntax of the visual language to be defined by a graph grammar...
194
click to vote
DDECS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
161
click to vote
WCNC
2008
IEEE
16 years 1 months ago
2008
IEEE
—In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channe...
182
click to vote
COMSWARE
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Scalable network localization is key for realizing ad-hoc networks. In this paper we propose a localization scheme where nodes form a relative coordinate system of the ...