arXiv (All)
open access
A Metaheuristic Optimization Framework for Discrete Optimization under Strict Time Limits
Real-time applications often rely on optimization approaches that can find high-quality solutions to hard problems on the order of milliseconds. Metaheuristic optimization frameworks (MOFs) are useful tools for such tasks, as they provide large sets of general-purpose search mechanisms that can retu
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
- TFR-GNN: Topology- and Fault-Aware Graph Neural Scheduling for Heterogeneous Distributed Computing Systems#986938
- For which problems in P is it easier to verify the result than to find it?#787574
- GPU-Enabled Large-Scale Optimization Using Randomized Linear Algebra#985521
- CuACD: A Fully GPU-Resident Approximate Convex Decomposition#1076387
- Information-Theoretic Optimization for Task-Adapted Compressed Sensing Magnetic Resonance Imaging#13102
Record · ID 1012872
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