Sciweavers

534 search results - page 67 / 107
» Diameter critical graphs
Sort
View
ISER
1993
Springer
123views Robotics» more  ISER 1993»
15 years 3 months ago
Mobile Robot Miniaturisation: A Tool for Investigation in Control Algorithms
The interaction of an autonomous mobile robot with the real world critically depends on the robots morphology and on its environment. Building a model of these aspects is extremel...
Francesco Mondada, Edoardo Franzi, Paolo Ienne
ESORICS
2011
Springer
13 years 10 months ago
Automated Information Flow Analysis of Virtualized Infrastructures
The use of server virtualization has been growing steadily, but many enterprises still are reluctant to migrate critical workloads to such infrastructures. One key inhibitor is the...
Sören Bleikertz, Thomas Groß, Matthias ...
108
Voted
ASPDAC
2001
ACM
102views Hardware» more  ASPDAC 2001»
15 years 2 months ago
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
Andrew B. Kahng, Shailesh Vaya, Alexander Zelikovs...
ICDCS
2008
IEEE
15 years 5 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
FOCS
2008
IEEE
15 years 5 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly