Results 41 to 50 of about 76,534 (153)
Disjoint cycles and spanning graphs of hypercubes
, 2004 The aim of this paper is to prove that double starlike trees are embedable into hypercubes, which answers an open question posed by Ivan Havel (Časopis Pěst. Mat. 109 (1984) 135). For this, a theorem about partitioning the hypercubes into vertex-disjoint
Mollard, Michel, Kobeissi, Mohamed
core +1 more source
Counting Independent Sets in Percolated Graphs via the Ising Model
Random Structures &Algorithms, Volume 68, Issue 1, January 2026.ABSTRACT Given a graph G$$ G $$, we form a random subgraph Gp$$ {G}_p $$ by including each edge of G$$ G $$ independently with probability p$$ p $$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite graphs satisfying certain vertex‐isoperimetric properties, extending the work of ...
Anna Geisler +3 more
wiley +1 more source
On the Structure of Events in Boolean Games [PDF]
, 2014 Conventional Boolean games embody two important assumptions: (i) all events in the game occur simultaneously; and (ii) assignments to variables must be made in complete ignorance of the values assigned to other variables.
Bradfield, Julian; id_orcid +2 more
core
IET Renewable Power Generation, Volume 20, Issue 1, January/December 2026.This study proposes a multi‐stage stochastic bidding framework for integrated energy refueling stations (IERS) that co‐optimize electricity trading, ancillary‐service provision, battery dispatch, and on‐site hydrogen production/refueling under time‐evolving uncertainties in PV output, market prices, and EV/FCEV demand.
Ximu Liu +8 more
wiley +1 more source
IET Renewable Power Generation, Volume 20, Issue 1, January/December 2026.The entire evaluation process is executed in a rolling time‐window manner. Every hour, the prediction window slides forward and the modelling and simulation are repeated to dynamically update the credible capacity assessment results. This method generates a time‐varying credible capacity curve, suitable for system dispatch and reserve strategy ...
Weixin Yang +3 more
wiley +1 more source
, 2022 These hypercubes generalize the well-known Graeco-Latin squares. In one dimension m hypercube we have pm 'points' with m coordinates taking the values 0; 1; : : : ; p 1. In each point we locate letters from m distinct alphabets. When we vary one of the
Mexia, João T. +3 more
core
Learning Union of Integer Hypercubes with Queries (with applications to monadic decomposition)
, 2021 This archive is provided as artifact material for the article "Learning Union of Integer Hypercubes with Queries (with applications to monadic decomposition)" Accepted for publication at CAV2021. Abstract: We study the problem of learning a finite union
STAN, Daniel +2 more
core +1 more source
Journal of Applied Mathematics, Volume 2026, Issue 1, 2026.Financial distress prediction demands models that balance complex pattern recognition with interpretable decision logic. This study reframes the prediction task as a Boolean satisfiability (SAT) problem and introduces a hybrid neurosymbolic framework, Hopfield neural network (HNN)–RANkSATRA, that integrates HNNs with metaheuristic optimization to ...
Hamza Abubakar +3 more
wiley +1 more source
A Pure Dual Approach for Hedging Bermudan Options
Mathematical Finance, Volume 35, Issue 4, Page 745-759, October 2025.ABSTRACT This paper develops a new dual approach to compute the hedging portfolio of a Bermudan option and its initial value. It gives a “purely dual” algorithm following the spirit of Rogers in the sense that it only relies on the dual pricing formula.
Aurélien Alfonsi +2 more
wiley +1 more source
Construction of orthogonal and nearly orthogonal Latin hypercubes
, 2009 We propose a method for constructing orthogonal or nearly orthogonal Latin hypercubes. The method yields a large Latin hypercube by coupling an orthogonal array of index unity with a small Latin hypercube.
Boxin Tang +5 more
core +1 more source