Results 31 to 40 of about 2,393 (165)
ABSTRACT We study eigenvalue problems for the de Rham complex on varying three‐dimensional domains. Our analysis includes the Helmholtz equation as well as the Maxwell system with mixed boundary conditions and non‐constant coefficients. We provide Hadamard‐type formulas for the shape derivatives under weak regularity assumptions on the domain and its ...
Pier Domenico Lamberti +2 more
wiley +1 more source
Random Primes without Primality Testing
Numerous algorithms call for computation over the integers modulo a randomly-chosen large prime. In some cases, the quasi-cubic complexity of selecting a random prime can dominate the total running time. We propose a new variant of the classic D5 algorithm for "dynamic evaluation", applied to a randomly-chosen (composite) integer.
Giorgi, Pascal +3 more
openaire +2 more sources
ABSTRACT We are concerned with the stability of a transferable‐utility cooperative (TU) game. First, the concept of core can be weakened so that the blocking of changes is limited to only those with multilateral backings. This principle of consensual blocking, as well as the traditional core‐defining one of unilateral blocking and one straddling in ...
Jian Yang
wiley +1 more source
An Exact Method for Reliable Shortest Path Problems With Correlation
ABSTRACT Shortest path problems often arise in contexts where travel times are uncertain. In these settings, reliable paths are often valued more than paths with lower expected travel times. This has led to several variants of reliable shortest path problems (RSPP) that handle travel time reliability differently. We propose an algorithmic framework for
Esteban Leiva +3 more
wiley +1 more source
With the boom in information technology and the penetration of these technologies in an increasing number of areas, such as electronic business, many questions about security arise. Data in electronic form bring many benefits, but they are vulnerable to various abuses. Therefore, data need to be adequately protected.
openaire +3 more sources
Carmichael Numbers on a Quantum Computer [PDF]
We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type.
Carlini, A., Hosoya, A.
core +1 more source
Melodies of the forest: Nature as an improvisational space for shared creative embodiment
Abstract In an era marked by increasing disconnection from nature, innovative approaches to reconnect with the environment are crucial for both ecological and psychological well‐being. This paper explores how natural environments (a deciduous forest of Quebec in the present case study) can serve as an improvisational space for shared creative ...
Antoine Bellemare‐Pepin +2 more
wiley +1 more source
The test consists in comparing a number (p?) of which one wants to establish the primality or not, with a composite number (which I call (L)) which contains the majority of possible prime numbers; it does not recognize prime numbers but composite numbers. This is obviously a test limited to the prime numbers present in (L).
openaire +1 more source
ABSTRACT Sustainable development transforms production systems, requiring integrated environmental, social, and economic strategies. Energy systems are key agro‐industrial supply chains in developing countries. Brazil's soybean supply chain impacts Gross Domestic Product, mainly through exports.
Aline Veronese da Silva +3 more
wiley +1 more source
Randomization and probabilistic approach in the algorithms development occupy prominent place.Due to limited computing resources and complexity many tasks in some cases it’s impossible to obtain accurate results or it’s too costly, so the results may contain some uncertainty. There are also cases when the indeterminacy of the algorithm is its advantage,
openaire +3 more sources

