Sciweavers

2612 search results - page 10 / 523
» Switching Graphs and Their Complexity
Sort
View
VIZSEC
2004
Springer
14 years 3 months ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia
INFOCOM
2003
IEEE
14 years 3 months ago
Exploiting Parallelism to Boost Data-Path Rate in High-Speed IP/MPLS Networking
Abstract—Link bundling is a way to increase routing scalability whenever a pair of Label Switching Routers in MPLS are connected by multiple parallel links. However, link bundlin...
Indra Widjaja, Anwar Elwalid
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
14 years 3 months ago
Regrasp Planning of Four-Fingered Hand for Parallel Grasp of a Polygonal Object
— This paper proposes a necessary and sufficient condition for parallel grasps. We extend the use of this condition to the task of regrasp planning. In particular, we propose a ...
Thanathorn Phoka, Peam Pipattanasomporn, Nattee Ni...
CATS
2008
13 years 11 months ago
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
14 years 2 months ago
Modal and transition dwell time computation in switching systems: a set-theoretic approach
We consider a plant the dynamics of which switch among a family of systems. Each of these systems has a single stable equilibrium point. We assume that a constraint region for the...
Franco Blanchini, Daniele Casagrande, Stefano Mian...