Web This site Trusted
30 result(s) for “if com site can kernel org site lemma would site www kernel org site:arxiv.org” of 100 matched · page 2 · 583 ms
Scope: Nishi’s own index (our crawl + Common Crawl) — not the whole live web. Some sites block all automated crawlers (anti-bot walls), so their pages may be absent here even though we never filter lawful content.
Did you mean if com site can kernel org site lemmy would site www kernel org site:arxiv.org?
Freshness: no result on this page carries a fetch time yet (indexed before the fetch epoch was stored beside the doc)
https://arxiv.org/list/cs.DC/new
SE)
Automating GPU kernel optimization remains difficult in practice: generated variants can violate correctness constraints, runtime measurements are noisy, and search often stalls early
https://arxiv.org/list/cs.DB/new
We propose an architectural pattern for such systems, a trusted kernel with a generative shell, resting on one invariant: a component that can fabricate may influence which question the system answers, never which value it returns
https://arxiv.org/list/cs.OS/new
Applications may therefore slow down before the kernel kills a process
https://arxiv.org/abs/2609.14858
Across algorithm engineering, mathematical optimization, and GPU kernel engineering, \textsc{Dream-RSI} achieves competitive or improved discovery quality while substantially reducing discovery cost in several settings
https://arxiv.org/abs/1202.3424
2 includes support for MPI, OpenMP, and the Intel Math Kernel Library (MKL)
https://arxiv.org/list/econ/new
up to 2000 entries per page: fewer | more | all
New submissions (showing 21 of 21 entries)
[1] arXiv:2608
https://arxiv.org/list/cs.NA/new
all
New submissions (showing 18 of 18 entries)
[1] arXiv:2608
https://arxiv.org/html/2608.03411v1
com
Abstract
Accurate Uncertainty Quantification (UQ) is critical for reliable deployment of Large Language Models (LLMs), yet traditional probability-based metrics often fail to capture the model’s true epistemic state
https://arxiv.org/list/cs.SE/new
Yet it remains unclear when further evolution helps, how successful and failed trajectories shape revision, and whether extra test-time computation can recover the same gains
https://arxiv.org/list/cs.CV/new
Project Page: this https URL
[2] arXiv:2608
https://arxiv.org/list/math.ST/2024-03
00186 [pdf, html, other]
Title: Warped Kernel Estimator for I
https://arxiv.org/list/eess/new
The design relies on two affine Volterra transformations involving both Fredholm- and Volterra-type integral terms, which results in a four-PIDE kernel equations
https://arxiv.org/abs/2504.02246
C* extends C with verification capabilities, powered by a symbolic execution engine and an LCF-style proof kernel
https://arxiv.org/list/cs.LG/2024-12
3251-3298
Showing up to 50 entries per page: fewer | more | all
[1] arXiv:2412
https://arxiv.org/list/astro-ph.SR/new
per page: fewer | more | all
New submissions (showing 19 of 19 entries)
[1] arXiv:2608
https://arxiv.org/html/2205.01882v5
2 Details of the DVD Dataset
M Additional Empirical Application: Fishing-site Choice
M
https://arxiv.org/html/2608.03504v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/pdf/2006.02318
org/pdfua/ns/id/ pdfuaid PDF/UA ID Schema internal Part of PDF/UA standard part Integer PRISM metadata http://prismstandard
https://arxiv.org/html/2508.08980v3
org perpetual non-exclusive license
arXiv:2508
https://arxiv.org/html/2608.02943v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2403.16413v3
org perpetual non-exclusive license
arXiv:2403
https://arxiv.org/html/2608.02609v1
edu
Abstract
Half a million cuneiform clay tablets survive in museums worldwide, yet modern users can neither read nor write in the world’s oldest writing system, leaving a 4,000-year cultural barrier that existing NLP tools have only partially addressed
https://arxiv.org/html/2608.03573v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2407.00419v1
If we make no assumptions about the target population, we can do little more than attempt to mimic observed behavior as closely as possible, reducing the problem to one of imitation learning
https://arxiv.org/html/2608.02942v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2407.00575v3
Even worse, the manager would need to collect the parameters periodically if they are time-varying, and then solve the large-scale optimization problem again
https://arxiv.org/html/2604.05327v4
This version:
I would like to thank Xu Cheng, Frank Diebold, Wayne Gao, George Mailath, and seminar participants at Chicago Booth, Paris Econometrics Seminar, Toulouse School of Economics, and the University of Pennsylvania for valuable discussions and comments that substantially improved this article
https://arxiv.org/html/2407.04889v1
(2019b); however, in general settings it is not known how to best play against mean-based learners, even if the agent knows everything about the learners, and can predict with certainty what actions they would take as a function of the history of play
https://arxiv.org/html/2608.03703v1
Dispersing the rebalance through the session, Korea’s chosen remedy, moves the order but not the reference that sizes it and can raise the toll
https://arxiv.org/html/2608.03452v1
Prior studies have shown that character-level transformers can reproduce this pattern, but that evidence describes what models produce, not what they represent