Results 201 to 210 of about 14,100 (298)

A formalization of Heisenbugs and their causes in terms of hyperproperties. [PDF]

Softw Syst Model
Sallinger S, Weissenbacher G, Zuleger F.
europepmc   +1 more source

Corrigendum: The 3‐sparsity of Xn−1$X^n-1$ over finite fields of characteristic 2

Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract This corrigendum corrects an error in the article “The 3‐sparsity of Xn−1$X^n-1$ over finite fields of characteristic 2,” Transactions of the London Mathematical Society 13 (2026), e70026, DOI: 10.1112/tlm3.70026.
Kaimin Cheng
wiley   +1 more source

Three-Discipline Collaborative Radiation Therapy (3DCRT) debate: Medical physics should focus less on geometric precision and more on biological outcomes. [PDF]

J Appl Clin Med Phys
de Kermenguy F, Ellsworth SG, Facciabene A, Durante M, Pacelli R, St-Aubin J, Wang D.   +6 more
europepmc   +1 more source

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

Journal of Graph Theory, Volume 113, Issue 3, Page 411-427, November 2026.
ABSTRACT A (2‐dimensional) realisation of a graph G is a pair ( G , p ), where p maps the vertices of G to R 2. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We say that G is rigid if every generic realisation of G is rigid; otherwise, G is flexible. In this paper, we investigate
Katie Clinch, Dániel Garamvölgyi, John Haslegrave, Tony Huynh, Jan Legerský, Anthony Nixon   +5 more
wiley   +1 more source

Climate-control ChatGPT for EFL writing and AI literacy. [PDF]

Front Artif Intell
Aldamen H, Alawneh SM, Almashour M, Al-Deaibes M, Alsharefeen R.   +4 more
europepmc   +1 more source

Weak Degeneracy of Planar Graphs

Journal of Graph Theory, Volume 113, Issue 3, Page 399-410, November 2026.
ABSTRACT The weak degeneracy of a graph G is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d‐degenerate graph is weakly d‐degenerate, but the converse is not true in general (e.g., all connected d‐regular graphs except cycles and cliques
Anton Bernshteyn, Eugene Lee, Evelyne Smith‐Roberge   +2 more
wiley   +1 more source

No good Markov strategies for Büchi objectives in countable MDPs. [PDF]

Ann Oper Res
Kiefer S, Mayr R, Shirmohammadi M, Totzke P.   +3 more
europepmc   +1 more source

A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

Journal of Graph Theory, Volume 113, Issue 3, Page 462-469, November 2026.
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley   +1 more source

Responses to criticisms. [PDF]

Asian J Philos
Shan Y, Williamson J.
europepmc   +1 more source

Fading Attention and the Pricing of Default Risk in the German Market for Structured Products

Journal of Futures Markets, Volume 46, Issue 10, Page 1787-1808, October 2026.
ABSTRACT Structured retail products are unsecured bonds subject to the default risk of the issuer. We analyze the price‐setting policy of issuers with respect to this default risk. Using a long‐term data set of discount certificates in the German market, we apply a time series IVX‐approach to find that (i) quoted prices do depend on issuer default risk,
Rainer Baule, Falk Jensen
wiley   +1 more source