Sciweavers

172 search results - page 15 / 35
» Planar Graphs with Topological Constraints
Sort
View
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
14 years 1 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
SAC
2010
ACM
14 years 4 months ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
GD
2007
Springer
14 years 1 months ago
Efficient Extraction of Multiple Kuratowski Subdivisions
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
Markus Chimani, Petra Mutzel, Jens M. Schmidt
DATE
2008
IEEE
129views Hardware» more  DATE 2008»
14 years 4 months ago
Memory Technology for Extended Large-Scale Integration in Future Electronics Applications
Extending 2-D planar topologies in integrated circuits (ICs) to a 3-D implementation has the obvious benefits of reducing the overall footprint and average interconnection length,...
Dinesh Pamunuwa
TIT
2010
141views Education» more  TIT 2010»
13 years 4 months ago
Distributed averaging via lifted Markov chains
Abstract--Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algo...
Kyomin Jung, Devavrat Shah, Jinwoo Shin