Výsledky vyhledávání - Mathematics of computing Discrete mathematics Graph theory Paths and connectivity problems~

Equality Saturation for Datapath Synthesis: A Pathway to Pareto Optimality Autor 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…”
Získat plný text

Neuromorphic Computing for Graph Analytics Autor 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…”
Získat plný text

Finding Spatial Clusters Susceptible to Epidemic Outbreaks due to Undervaccination Autor 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…”
Získat plný text

Fast iterative graph computation: a path centric approach Autor 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…”
Získat plný text

Analysis of the O-GEometric History Length Branch Predictor Autor 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…”
Získat plný text

Predictive QoS routing to mobile sinks in wireless sensor networks Autor 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…”
Získat plný text

Piecewise Linear Branch Prediction Autor 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…”
Získat plný text

Program generation for the all-pairs shortest path problem Autor 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…”
Získat plný text

Focusing processor policies via critical-path prediction Autor 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…”
Získat plný text

Statistical Timing Analysis with Extended Pseudo-Canonical Timing Model Autor 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…”
Získat plný text

Maze routing with buffer insertion and wiresizing Autor 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…”
Získat plný text

Adaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs Autor 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…”
Získat plný text

Provably Good Max-Min-m-neighbor-TSP-Based Subfield Scheduling for Electron-Beam Photomask Fabrication Autor 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…”
Získat plný text

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

“…We focus on the problem of scalable shortest path analytics for large social graphs in this paper…”
Získat plný text

Post-route gate sizing for crosstalk noise reduction Autor 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…”
Získat plný text

ARA+: Improved Path Planning Algorithm Based on ARA Autor 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…”
Získat plný text

Post-routing redundant via insertion for yield/reliability improvement Autor 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…”
Získat plný text

A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design Autor 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…”
Získat plný text

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

“… However, in many real-world problems we realize that path length is not only the sole objective…”
Získat plný text

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

Získat plný text