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

“…Equality saturation, originally developed in the late 1970s for use in automated theorem provers, has been recently advanced to perform scalable rule-based…”
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…”
Get full text

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

“…Geographical clusters of undervaccinated populations have emerged in various parts of the United States in recent years. Public health response involves…”
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

Piecewise Linear Branch Prediction by Jimenez, Daniel A.

“…Improved branch prediction accuracy is essential to sustaining instruction throughput with todayýs deep pipelines. We introduce piecewise linear branch…”
Get full text

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

“…Large scale graph processing represents an interesting challenge due to the lack of locality. This paper presents PathGraph for improving iterative graph…”
Get full text

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

“…A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and re-optimizing libraries for fast-changing…”
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 present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to…”
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. This…”
Get full text

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

“…Although some instructions hurt performance more than others, current processors typically apply scheduling and speculation as if each instruction was equally…”
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…”
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. The…”
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

“…Electron beam lithography (EBL) has been used for high-resolution photomask fabrication; its successive heating process in a certain region, however, may cause…”
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.

“…Gate sizing is a practical and a feasible crosstalk noise repair technique in the post route design stage, especially for block level sea-of-gates designs. The…”
Get full text

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

“…Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to…”
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

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. While shortest path distance problem has been investigated…”
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

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

“…Path planning is a crucial issue in unknown environments where an autonomous mobile agent has to reach a particular destination from some initial location…”
Get full text

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

“…In this paper, we present a bottom-up clustering algorithm based on recursive collapsing of small cliques in a graph. The sizes of the small cliques are…”
Get full text