Sciweavers

2254 search results - page 388 / 451
» Computing the minimal covering set
Sort
View
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 10 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh
COMCOM
2006
93views more  COMCOM 2006»
13 years 10 months ago
A novel method for QoS provisioning with protection in GMPLS networks
In this paper, a new optimal policy is introduced to determine, adapt, and protect the Generalized MultiProtocol Label Switching (GMPLS) network topology based on the current traf...
Tricha Anjali, Caterina M. Scoglio
ENTCS
2006
155views more  ENTCS 2006»
13 years 10 months ago
Biomolecular Agents as Multi-behavioural Concurrent Objects
In recent years, there has been increasing interest in computational models of biological systems based on various calculi of communicating processes, such as the stochastic pi-ca...
Denys Duchier, Céline Kuttler
EOR
2006
129views more  EOR 2006»
13 years 10 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
EOR
2006
128views more  EOR 2006»
13 years 10 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...