Web This site Trusted
30 result(s) for “if com favor site code web de site lemma would site datatracker if org site:arxiv.org” of 76 matched · 1198 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 favor site code web de site lemmy would site datatracker if 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)
This study synthesizes adjacent research and introduces Enactive AI as a conceptual framework for enterprise and industry reasoning, site-level decision support, and execution feedback
from the top result below
https://arxiv.org/list/cs.AI/new
A core calculus gives an effect-confinement lemma and six safety properties
https://arxiv.org/html/2608.03573v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/list/cs.CR/new
fewer | more | all
New submissions (showing 32 of 32 entries)
[1] arXiv:2608
https://arxiv.org/list/math/new
It is natural to expect that if many pairs $(x_i,x_j)$ lie at distance close to $1$ from each other, then some clustering phenomenon must occur, implying that a significant number of these pairs are also very close to each other
https://arxiv.org/list/cs.CL/new
3% coverage), and a visual tablet renderer, packaged as a pip-installable toolkit with CLI and web demo
https://arxiv.org/list/cs.IT/new
all
New submissions (showing 11 of 11 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/2607.22511v2
The source code, formal library, and run records are available at https://github
https://arxiv.org/pdf/2006.02318
If defined, must be one of book, catalog, feed, journal, magazine, manual, newsletter, pamphlet
https://arxiv.org/html/2608.02609v1
Code and pretrained model: https://github
https://arxiv.org/html/2511.06451v1
1 Data Protocol (arXiv Release)
Synthetic risk–neutral generator
https://arxiv.org/html/2407.00419v1
W say that a population of adaptive agents is socially intelligent if its members are (1) individually Hannan-consistent and (2) compatible in the sense that any pair of agents will perform nearly as well as some Pareto-optimal Nash equilibrium of the matrix game
https://arxiv.org/html/2508.08980v3
org perpetual non-exclusive license
arXiv:2508
https://arxiv.org/html/2608.03504v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2608.03703v1
Claude Opus 5 and Fable 5 provided research assistance throughout, spanning code development, data construction and empirical analysis, and the drafting of the manuscript
https://arxiv.org/html/2608.02943v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/list/cond-mat/new
The mixed anomaly between these is accommodated by the not-on-site action of the symmetries
https://arxiv.org/list/cs.DS/new
If the input strings have lengths $N$ and $M$, and their run-length encodings have $n$ and $m$ runs, respectively, the algorithm runs in $O(mN+nM)$ time using $O(nm)$ space
https://arxiv.org/html/2403.16413v3
org perpetual non-exclusive license
arXiv:2403
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
For these problems, it is therefore always optimal for the decision-maker to proceed as if the likelihood were correctly specified and select the resulting optimal decision rule
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/2407.18010v2
Since acting at each available opportunity would accumulate prohibitively large costs, the resulting decision problem is one in which players must make strategic decisions about when to execute actions in addition to their choice of action
https://arxiv.org/html/2407.05763v1
A system is said to be finite-time stable if it is Lyapunov stable and its states reach zeros at a finite instant of time (which may depend on the initial state of the system)
https://arxiv.org/html/2607.28577v1
org perpetual non-exclusive license
arXiv:2607
https://arxiv.org/html/2608.02942v1
org perpetual non-exclusive license
arXiv:2608
https://arxiv.org/html/2508.20108v2
Normalization for Accurate Prediction
1 Introduction
2 Related Works
2.1 Geometric Brownian Motion
2.2 Deep Learning-Based Stock Price Prediction
2.3 Methods for Addressing Distribution Shift
3 Proposed Method
3.1 Overview
3.2 Return
https://arxiv.org/html/2607.26405v1
& Optimal Design
Report GitHub Issue
Ă—
Title:
Content selection saved. Describe the issue below:
Description:
Submit without GitHub Submit in GitHub
arXiv is now an independent nonprofit! Learn more Ă—
Back to arXiv
Why HTML? Report
https://arxiv.org/html/2608.03452v1
de
Abstract
When a transformer learns an irregular morphological pattern, what has it learned
https://arxiv.org/html/2407.10811v1
II RELATED WORK
II-A Traditional methods
II-B RL methods.
III PRELIMINARIES
IV METHOD
IV-A RL Setup
IV-B Network design
IV-C Training
IV-D Theoretical Analysis
V EXPERIMENT
V-A Towards Real-world Dataset and Simulation
V-B Benchmark