Search Results - Mathematics of computing Discrete mathematics Graph theory Paths and connectivity problems

Equality Saturation for Datapath Synthesis: A Pathway to Pareto Optimality by Ustun, Ecenur, Yu, Cunxi, Zhang, Zhiru

“… domains, such as program synthesis, compiler optimization, and datapath synthesis. Constructing an e-graph using rewrite rules that preserve program functionality…”
Get full text

Neuromorphic Computing for Graph Analytics by Das, Anup

“…Finding the single-source shortest paths (SSSP) in a weighted graph is a fundamental problem in computer science with many practical applications, including network flow and social network analysis…”
Get full text

Finding Spatial Clusters Susceptible to Epidemic Outbreaks due to Undervaccination by Cadena, Jose, Marathe, Achla, Vullikanti, Anil

“… We focus on finding clusters that maximize this measure and develop efficient approximation algorithms for finding critical clusters by exploiting structural properties of the problem…”
Get full text

Fast iterative graph computation: a path centric approach by Yuan, Pingpeng, Zhang, Wenya, Xie, Changfeng, Jin, Hai, Liu, Ling, Lee, Kisung

“… Our system design has three unique features: First, we model a large graph using a collection of tree-based partitions and use an path-centric computation rather than vertex-centric or edge-centric computation…”
Get full text

Analysis of the O-GEometric History Length Branch Predictor by Seznec, Andre

“…In this paper, we introduce and analyze the Optimized GEometric History Length (O-GEHL) branch Predictor that efficiently exploits very long global histories…”
Get full text

Predictive QoS routing to mobile sinks in wireless sensor networks by Kusy, Branislav, Lee, HyungJune, Wicke, Martin, Milosavljevic, Nikola, Guibas, Leonidas

“… We address this problem by introducing the mobility graph, which encodes knowledge about likely mobility patterns within the network…”
Get full text

Piecewise Linear Branch Prediction by Jimenez, Daniel A.

“… We introduce piecewise linear branch prediction, an idealized branch predictor that develops a set of linear functions, one for each program path to the branch to be predicted, that separate…”
Get full text

Program generation for the all-pairs shortest path problem by Han, Sung-Chul, Franchetti, Franz, Puschel, Markus

“… In this paper, we extend this list by a program generator for the well-known Floyd-Warshall (FW) algorithm that solves the all-pairs shortest path problem, which is important in a wide range of engineering applications…”
Get full text

Focusing processor policies via critical-path prediction by Fields, Brian, Rubin, Shai, Bodík, Rastislav

“… Instruction cost can be naturally expressed through the critical path: if we could predict it at run-time, egalitarian policies could be replaced with cost-sensitive strategies that will grow increasingly effective as processors become more parallel…”
Get full text

Statistical Timing Analysis with Extended Pseudo-Canonical Timing Model by Zhang, Lizheng, Chen, Weijen, Hu, Yuhen, Chen, Charlie Chung-Ping

“…State of the art statistical timing analysis (STA) tools often yield less accurate results when timing variables become correlated due to global source of variations and path reconvergence…”
Get full text

Maze routing with buffer insertion and wiresizing by Lai, Minghorng, Wong, D. F.

“…We propose an elegant formulation of the Maze Routing with Buffer Insertion and Wiresizing pr oblem as a graph-the oretic shortest path problem…”
Get full text

Adaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs by Takes, Frank W., Kosters, Walter A.

“…This paper considers the task of answering shortest path queries in large real-world graphs such as social networks, communication networks and web graphs…”
Get full text

Provably Good Max-Min-m-neighbor-TSP-Based Subfield Scheduling for Electron-Beam Photomask Fabrication by Lin, Zhi-Wen, Fang, Shao-Yun, Chang, Yao-Wen, Rao, Wei-Cheng, Kuan, Chieh-Hsiung

“… of subfields in the writing process is desirable to avoid the heating problem and thus CD distortion…”
Get full text

Graph Calculus: Scalable Shortest Path Analytics for Large Social Graphs through Core Net by Lixin Fu, Jing Deng

“…We focus on the problem of scalable shortest path analytics for large social graphs in this paper…”
Get full text

Post-route gate sizing for crosstalk noise reduction by Becer, Murat R., Blaauw, David, Algor, Ilan, Panda, Rajendran, Oh, Chanhee, Zolotov, Vladimir, Hajj, Ibrahim N.

“… This can create cyclical dependencies between nets in the circuit with noise violations. In this paper, we propose a fast and effective heuristic post-route gate sizing algorithm that uses a graph representation of the noise dependencies between nodes…”
Get full text

ARA+: Improved Path Planning Algorithm Based on ARA by Li, Bo, Gong, Jianwei, Jiang, Yan, Nasry, Hany, Xiong, Guangming

“…A* path planning algorithm cannot always guarantee the continuity of a robot's movements when the allocated time is limited, however Anytime Repairing A*(ARA…”
Get full text

Post-routing redundant via insertion for yield/reliability improvement by Lee, Kuang-Yao, Wang, Ting-Chi

“… We present an efficient graph construction algorithm to model the problem, and an effective MIS heuristic to solve the problem…”
Get full text

A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design by Cong, Jason, Smith, M'Lissa

“… The sizes of the small cliques are derived using random graph theory. This clustering algorithm leads to a natural parallel implementation in which multiple processors are used to identify clusters simultaneously…”
Get full text

A Multi-objective Incremental Path Planning Algorithm for Mobile Agents by Oral, Tugcem, Polat, Faruk

“… However, in many real-world problems we realize that path length is not only the sole objective…”
Get full text

Spectral K-way ratio-cut partitioning and clustering by Chan, Pak K., Schlag, Martine D. F., Zien, Jason Y.

Get full text