Suchergebnisse - Mathematics of computing Discrete mathematics Graph theory Paths and connectivity problems*

Equality Saturation for Datapath Synthesis: A Pathway to Pareto Optimality von 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 …”
Volltext

Neuromorphic Computing for Graph Analytics von 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 …”
Volltext

Finding Spatial Clusters Susceptible to Epidemic Outbreaks due to Undervaccination von 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 …”
Volltext

Analysis of the O-GEometric History Length Branch Predictor von 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 …”
Volltext

Piecewise Linear Branch Prediction von 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 …”
Volltext

Fast iterative graph computation: a path centric approach von 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 …”
Volltext

Program generation for the all-pairs shortest path problem von 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 and increasingly complex computing platforms …”
Volltext

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

“… Our algorithm is based on information potentials, which we extend to account for mobility. We show that for local movement along edges in the communication graph …”
Volltext

Maze routing with buffer insertion and wiresizing von 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 …”
Volltext

Focusing processor policies via critical-path prediction von 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 …”
Volltext

Statistical Timing Analysis with Extended Pseudo-Canonical Timing Model von 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 …”
Volltext

Adaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs von 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 …”
Volltext

Provably Good Max-Min-m-neighbor-TSP-Based Subfield Scheduling for Electron-Beam Photomask Fabrication von 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 …”
Volltext

Post-route gate sizing for crosstalk noise reduction von 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 …”
Volltext

Post-routing redundant via insertion for yield/reliability improvement von 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 …”
Volltext

ARA+: Improved Path Planning Algorithm Based on ARA von 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 …”
Volltext

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

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

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

Volltext

A Multi-objective Incremental Path Planning Algorithm for Mobile Agents von 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 …”
Volltext

A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design von 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 …”
Volltext