Sciweavers

19130 search results - page 4 / 3826
» Modelling multi-path problems
Sort
View
EVOW
2009
Springer
13 years 8 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
SIAMMA
2010
66views more  SIAMMA 2010»
13 years 5 months ago
On a Nonlocal Reaction-Diffusion Problem Arising from the Modeling of Phytoplankton Growth
In this paper we analyze a nonlocal reaction-diffusion model which arises from the modeling of competition of phytoplankton species with incomplete mixing in a water column. The no...
Yihong Du, Sze-Bi Hsu
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
13 years 8 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
TRANSCI
2010
169views more  TRANSCI 2010»
13 years 5 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
COGSR
2011
71views more  COGSR 2011»
13 years 5 months ago
Psychological models of human and optimal performance in bandit problems
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...
Michael D. Lee, Shunan Zhang, Miles Munro, Mark St...