A new system for honest reporting in electricity markets
A blockchain framework helps ensure companies report their energy contributions truthfully even when verification takes time.
A blockchain framework helps ensure companies report their energy contributions truthfully even when verification takes time.
Researchers developed an algorithm to better manage capacity when requests arrive one by one.
Metal Sandbox uses command scheduling and isolated environments to improve efficiency on Apple Silicon.
Omakase uses conflict-graph integration to improve transaction execution throughput.
Researchers discovered that certain ways of predicting task orders are more resistant to errors than others.
New parallel algorithms compute the higher-order temporal H-index much faster than previous methods.
Researchers showed that a minimal quantum resource is enough to beat every classical proof system.
Researchers developed a way to extract satisfying assignments using low-depth circuit classes.
Limited workspace requires polynomial update times for connectivity in a new dynamic model.
Researchers improved complexity bounds from PSPACE to the counting hierarchy CH for several problems.
Researchers analyzed how repeated linear programming steps can find solutions for a specific constraint satisfaction problem.
The C-3PO framework provides ways to estimate values and samples for spin models on graphs with low threshold rank or high girth.
New methods provide guarantees for nearest neighbour searches when sensor data has missing values.
Small experiments with product assortments can help retailers learn customer preferences and reduce revenue loss.
Researchers developed a unified modeling framework to evaluate different autoscaling strategies under bursty workloads.
Researchers developed F-SOSA to help models adapt quickly when devices join or leave a network.
Researchers developed efficient algorithms to estimate discrete distributions under person-level differential privacy.
Finding an optimal delayed deterministic finite automaton is NP-hard.
Researchers found new lower bounds for pivot-based approximate distance oracles.
Self-inclusive Freshness-weighted Gossip helps devices aggregate models after being offline.
Researchers designed evaluators to privately approximate function values using a black-box approach.
Researchers found a way to precisely model and optimize memory use during inference.
Researchers show that certain problems can be solved in time.
New methods show that policy iteration and value iteration run in smoothed polynomial time for deterministic games.