• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 246
Next 10 →

Orthogonal hypergraph drawing for improved visibility

by Thomas Eschbach, Wolfgang Günther, Bernd Becker - J. OF GRAPH ALGORITHMS AND APPLICATIONS , 2006
"... Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses orthogonal lines to connect the gates. In our model we assume that between two consecutive layers every net is allowed to o ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
to occupy only one track. This avoids unnecessary bends in the wires and helps to improve the clarity of the drawing. Then a crossing reduction step is applied to further improve the readability of the circuit schematics. First we assume that the nodes have already been fixed on a layered hypergraph

Joint Channel Assignment and Routing for Throughput Optimization in Multi-radio Wireless Mesh Networks

by Mansoor Alicherry , Randeep Bhatia , Li Erran Li , 2005
"... Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their singlehop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using o ..."
Abstract - Cited by 443 (0 self) - Add to MetaCart
orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways

Orthogonal Hypergraph Routing for . . .

by Thomas Eschbach, Wolfgang Günther, Bernd Becker , 2004
"... Visualization of circuits is an important research area in electronic design and automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses orthogonal lines to connect the gates. Our approach introduces the restriction that every net is allowed to occupy only ..."
Abstract - Add to MetaCart
only one track. This avoids unnecessary bends in the wires and helps to improve the clarity of the drawing. Then a crossing reduction step is applied to further improve the readability of the circuit schematics. In this paper we assume that the nodes have already been fixed on a layered hypergraph

Detecting BGP Configuration Faults with Static Analysis

by Nick Feamster, Hari Balakrishnan - in Proc. Networked Systems Design and Implementation , 2005
"... The Internet is composed of many independent autonomous systems (ASes) that exchange reachability information to destinations using the Border Gateway Protocol (BGP). Network operators in each AS configure BGP routers to control the routes that are learned, selected, and announced to other routers. ..."
Abstract - Cited by 188 (15 self) - Add to MetaCart
configurations using static analysis. rcc detects faults by checking constraints that are based on a high-level correctness specification. rcc detects two broad classes of faults: route validity faults, where routers may learn routes that do not correspond to usable paths, and path visibility faults, where

Seeing Around Corners: Fast Orthogonal Connector Routing

by Kim Marriott, Peter J. Stuckey, Michael Wybrow , 2014
"... Orthogonal connectors are used in drawings of many types of net-work diagrams, especially those representing electrical circuits. One approach for routing such connectors has been to compute an orthogonal visibility graph formed by intersecting vertical and horizontal lines projected from the corne ..."
Abstract - Add to MetaCart
of a 1-bend visibility graph significantly improves the speed of orthogonal connector routing.

Orthogonal Hyperedge Routing

by Michael Wybrow, Kim Marriott, Peter J. Stuckey , 2012
"... Orthogonal connectors are used in drawings of many network diagrams, especially those representing electrical circuits. Such diagrams frequently include hyperedges—single edges that connect more than two endpoints. While many interactive diagram editors provide some form of automatic connector rou ..."
Abstract - Add to MetaCart
routing we are unaware of any that provide automatic routing for orthogonal hyperedge connectors. We give three algorithms for hyperedge routing in an interactive diagramming editor. The first supports semi-automatic routing in which a route given by the user is improved by local transformations while

Improved Approximation Algorithms for Embedding Hypergraphs in a Cycle

by Teofilo F. Gonzalez - Information Processing Letters , 1998
"... Approximation algorithms embedding hypergraphs in a cycle so as to minimize the maximum congestion are presented. Our algorithms generate an embedding by transforming the problem into another problem that can be solved in polynomial time. One transforms it to a Linear Programming (LP) problem, and t ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
applications in CAD and parallel computation. Keywords: Approximation Algorithms, parallel computation, CAD, linear time algorithms, minimize congestion. 1 Introduction The problem of Embedding Hypergraphs in a Cycle so a to Minimize Congestion (EHCMC) [3] has applications in design automation (routing nets

AntHocNet: An adaptive nature-inspired algorithm for routing in mobile ad hoc networks

by Gianni Di Caro, Frederick Ducatelle, Luca Maria Gambardella - EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS , 2005
"... In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks. It is a hybrid algorithm, which combines reactive route setup with proactive route probing, maintenance and improvement. The algorithm is based on the Nature-inspired Ant Colony Optimization framework. Paths are ..."
Abstract - Cited by 108 (16 self) - Add to MetaCart
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks. It is a hybrid algorithm, which combines reactive route setup with proactive route probing, maintenance and improvement. The algorithm is based on the Nature-inspired Ant Colony Optimization framework. Paths

Finding a Needle in a Haystack: Pinpointing Significant BGP Routing Changes in an IP Network

by Jian Wu, Zhuoqing Morley Mao - In NSDI , 2005
"... The performance of a backbone network is vulnerable to interdomain routing changes that affect how traffic travels to destinations in other Autonomous Systems (ASes). Despite having poor visibility into these routing changes, operators often need to react quickly by tuning the network configuration ..."
Abstract - Cited by 81 (10 self) - Add to MetaCart
The performance of a backbone network is vulnerable to interdomain routing changes that affect how traffic travels to destinations in other Autonomous Systems (ASes). Despite having poor visibility into these routing changes, operators often need to react quickly by tuning the network configuration

Incidence Angle Constrained Visibility

by Gregoria Blanco, Jesus Garcia Lopez, Ferran Hurtado, Pedro Ramos, Vera Sacristan , 1996
"... We present the first part of a study on what we call quality pictures, where we introduce a quality parameter ff that indicates the minimum incidence angle allowed between the vision direction and a seen surface. We solve here some combinatorial and algorithmic problems about both external and inter ..."
Abstract - Add to MetaCart
restricting the class of polygons to be guarded (orthogonal, etc.), new kinds of guards have been introduced (edgeguards, mobile guards,...) and even watchman routes have been studied. Traditionally, it is assumed that guards can see in any direction. If we imagine cameras, instead of guards, this would imply
Next 10 →
Results 1 - 10 of 246
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University