KFUPM ePrints
metadata only
DCCP: Dynamic Core and Contention Partitioning for Optimizing Graph Workload Performance in Multi-Core Systems
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics#1117539
- CUTEv2: Unified and Configurable Matrix Extension for Diverse CPU Architectures with Minimal Design Overhead#10308
- Long-Range Indirect Control-Flow Prediction in Stripped Binaries via Dual Virtual Hubs and Multi-Task Graph Learning#639614
- Extended pinch targeting techniques for carbon-constrained energy sector planning#808211
- CompMat-Bench: Benchmarking AI Agents for Computational Materials Science#1155571
Record · ID 191227
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive