Sciweavers

167 search results - page 6 / 34
» On the Complexity of Finding Control Strategies for Boolean ...
Sort
View
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
13 years 5 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
CDC
2010
IEEE
13 years 2 months ago
A Switching strategy for robust cooperative exploration
Abstract-- This paper develops a switching strategy for networked mobile sensing agents to automatically decide when to perform individual exploration and when to perform cooperati...
Wencen Wu, Fumin Zhang
TWC
2010
13 years 2 months ago
Fast algorithms for joint power control and scheduling in wireless networks
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
Liqun Fu, Soung Chang Liew, Jianwei Huang
CHI
2005
ACM
14 years 8 months ago
Single complex glyphs versus multiple simple glyphs
Designers of information visualization systems have the choice to present information in a single integrated view or in multiple views. In practice, there is a continuum between t...
Beth Yost, Chris North
ALENEX
2010
143views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Navigation in Real-World Complex Networks through Embedding in Latent Spaces
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
Xiaomeng Ban, Jie Gao, Arnout van de Rijt