Sciweavers

8540 search results - page 104 / 1708
» The Dynamic Servers Problem
Sort
View
STACS
1999
Springer
15 years 2 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
IPSN
2003
Springer
15 years 3 months ago
Maximum Mutual Information Principle for Dynamic Sensor Query Problems
In this paper we study a dynamic sensor selection method for Bayesian filtering problems. In particular we consider the distributed Bayesian Filtering strategy given in [1] and sh...
Emre Ertin, John W. Fisher, Lee C. Potter
ARCS
2004
Springer
15 years 3 months ago
Ant Colony Optimization for dynamic Traveling Salesman Problems
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
Carlos A. Silva, Thomas A. Runkler
HM
2010
Springer
157views Optimization» more  HM 2010»
14 years 11 months ago
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...
André Renato Villela da Silva, Luiz Satoru ...
TRANSCI
2011
80views more  TRANSCI 2011»
14 years 4 months ago
The Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
Ivan Contreras, Jean-François Cordeau, Gilb...