|
|
|
|
|
Giorgio Lazzarinetti, Riccardo Dondi, Sara Manzoni and Italo Zoppis
Solving combinatorial problems on complex networks represents a primary issue which, on a large scale, requires the use of heuristics and approximate algorithms. Recently, neural methods have been proposed in this context to find feasible solutions for r...
ver más
|
|
|
|
|
|
|
|
|
Mauro Dell?Amico, Jafar Jamal and Roberto Montemanni
The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was presente...
ver más
|
|
|
|
|
|
|
|
|
Girolamo Musso, Iara Figueiras, Héléna Goubel, Afonso Gonçalves, Ana Laura Costa, Bruna Ferreira, Lara Azeitona, Simão Barata, Alain Souza, Frederico Afonso, Inês Ribeiro and Fernando Lau
The commercial space launch sector is currently undergoing a significant shift, with increasing competition and demand for launch services, as well as growing concerns about the environmental impact of rocket launches. To address these challenges, within...
ver más
|
|
|
|
|
|
|
|
|
Arturo J. Fernández
Confidence regions for the Weibull parameters with minimum areas among all those based on the Conditionality Principle are constructed using an equivalent diffuse Bayesian approach. The process is valid for scenarios involving standard failure and progre...
ver más
|
|
|
|
|
|
|
|
|
Raoul R. Nigmatullin and Jocelyn Sabatier
This work was greatly influenced by the opinions of one of the authors (JS), who demonstrated in a recent book that it is important to distinguish between ?fractal models? and ?fractal? (power-law) behaviors. According to the self-similarity principle (S...
ver más
|
|
|
|