English
Related papers

Related papers: Using a (slightly) more realistic model resolves t…

200 papers

This paper looks in detail at how an evolutionary algorithm attempts to solve instances from the multimodal problem generator. The paper shows that in order to consistently reach the global optimum, an evolutionary algorithm requires a…

Neural and Evolutionary Computing · Computer Science 2007-05-23 Fernando G. Lobo , Claudio F. Lima

Mathematical models of the real world are simplified representations of complex systems. A caveat to using mathematical models is that predicted causal effects and conditional independences may not be robust under model extensions, limiting…

Methodology · Statistics 2022-08-30 Tineke Blom , Joris M. Mooij

Efficient workload assignment to the workforce is critical in last-mile package delivery systems. In this context, traditional methods of assigning package deliveries to workers based on geographical proximity can be inefficient and surely…

The statistical description and modeling of volatility plays a prominent role in econometrics, risk management and finance. GARCH and stochastic volatility models have been extensively studied and are routinely fitted to market data, albeit…

Computational Engineering, Finance, and Science · Computer Science 2018-03-13 Nils Bertschinger , Iurii Mozzhorin , Sitabhra Sinha

Many real-world optimisation problems involve dynamic and stochastic components. While problems with multiple interacting components are omnipresent in inherently dynamic domains like supply-chain optimisation and logistics, most research…

Neural and Evolutionary Computing · Computer Science 2020-09-16 Ragav Sachdeva , Frank Neumann , Markus Wagner

The online knapsack problem is a classic problem in the field of online algorithms. Its canonical version asks how to pack items of different values and weights arriving online into a capacity-limited knapsack so as to maximize the total…

Machine Learning · Computer Science 2024-04-18 Adam Lechowicz , Rik Sengupta , Bo Sun , Shahin Kamali , Mohammad Hajiesmaili

In the past decade, many parameterized algorithms were developed for packing problems. Our goal is to obtain tradeoffs that improve the running times of these algorithms at the cost of computing approximate solutions. Consider a packing…

Data Structures and Algorithms · Computer Science 2015-05-05 Meirav Zehavi

Energy and pollution are urging problems of the 21th century. By gradually changing the actual power grid system, smart grid may evolve into different systems by means of size, elements and strategies, but its fundamental requirements and…

Optimization and Control · Mathematics 2025-12-19 Soufian Ben Amor , Alain Bui , Guillaume Guerard

This paper presents how the most recent improvements made on covariance matrix estimation and model order selection can be applied to the portfolio optimisation problem. The particular case of the Maximum Variety Portfolio is treated but…

Applications · Statistics 2018-04-03 Emmanuelle Jay , Eugénie Terreaux , Jean-Philippe Ovarlez , Frédéric Pascal

Consider a species whose population density solves the steady diffusive logistic equation in a heterogeneous environment modeled with the help of a spatially non constant coefficient standing for a resources distribution in a given box. We…

Analysis of PDEs · Mathematics 2018-07-25 Idriss Mazari , Grégoire Nadin , Yannick Privat

We consider a certain lattice branching random walk with on-site competition and in an environment which is heterogeneous at a macroscopic scale $1/\varepsilon$ in space and time. This can be seen as a model for the spatial dynamics of a…

Probability · Mathematics 2024-12-24 Pascal Maillard , Gaël Raoul , Julie Tourniaire

Understanding the mechanisms of species coexistence has always been a fundamental topic in ecology. Classical theory predicts that interspecific competition may select for traits that stabilize niche differences, although recent work shows…

Populations and Evolution · Quantitative Biology 2023-05-16 José F. Fontanari , Margarida Matos , Mauro Santos

We consider a generalization of the classical logistic growth model introducing more than one inflection point. The growth, called multi-sigmoidal, is firstly analyzed from a deterministic point of view in order to obtain the main…

Populations and Evolution · Quantitative Biology 2024-01-31 Antonio Di Crescenzo , Paola Paraggio , Patricia Román-Román , Francisco Torres-Ruiz

Meta-population networks are effective tools for capturing population movement across distinct regions, but the assumption of well-mixed regions fails to capture the reality of population higher-order interactions. As a multidimensional…

Physics and Society · Physics 2024-06-18 Yanyi Nie , Yanbing Liu , Qixuan Cao , Tao Lin , Wei Wang

Hierarchical modeling of abundance in space or time using closed-population mark-recapture under heterogeneity (model M$_{h}$) presents two challenges: (i) finding a flexible likelihood in which abundance appears as an explicit parameter…

Applications · Statistics 2015-04-10 Matthew R. Schofield , Richard J. Barker

Understanding the causes and effects of spatial aggregation is one of the most fundamental problems in ecology. Aggregation is an emergent phenomenon arising from the interactions between the individuals of the population, able to sense…

Populations and Evolution · Quantitative Biology 2015-06-05 Juan A. Bonachela , Miguel A. Munoz , Simon A. Levin

A class of models is introduced describing the evolution of population species whose carrying capacities are functionals of these populations. The functional dependence of the carrying capacities reflects the fact that the correlations…

Populations and Evolution · Quantitative Biology 2015-06-05 V. I. Yukalov , E. P. Yukalova , D. Sornette

We propose a stochastic logistic model with mate limitation and stochastic immigration. Incorporating stochastic immigration into a continuous time Markov chain model, we derive and analyze the associated master equation. By a standard…

Dynamical Systems · Mathematics 2016-05-24 Chuang Xu

In several applications of real-time matching of demand to supply in online marketplaces, the platform allows for some latency to batch the demand and improve the efficiency. Motivated by these applications, we study the optimal trade-off…

Data Structures and Algorithms · Computer Science 2022-12-01 Yiding Feng , Rad Niazadeh

We introduce a simple benchmark model of dynamic matching in networked markets, where agents arrive and depart stochastically and the network of acceptable transactions among agents forms a random graph. We analyze our model from three…

Computer Science and Game Theory · Computer Science 2014-02-18 Mohammad Akbarpour , Shengwu Li , Shayan Oveis Gharan
‹ Prev 1 4 5 6 7 8 10 Next ›