Sciweavers

810 search results - page 82 / 162
» Solving Time-Dependent Planning Problems
Sort
View
COR
2010
116views more  COR 2010»
13 years 8 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
ATAL
2007
Springer
14 years 2 months ago
Estimating information value in collaborative multi-agent planning systems
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...
David Sarne, Barbara J. Grosz
ACSAC
2004
IEEE
13 years 11 months ago
Attack Plan Recognition and Prediction Using Causal Networks
Correlating and analyzing security alerts is a critical and challenging task in security management. Recently, some techniques have been proposed for security alert correlation. H...
Xinzhou Qin, Wenke Lee
COR
2007
103views more  COR 2007»
13 years 8 months ago
A reactive GRASP and path relinking for a combined production-distribution problem
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...
ATMOS
2008
112views Optimization» more  ATMOS 2008»
13 years 9 months ago
Dynamic Algorithms for Recoverable Robustness Problems
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
Serafino Cicerone, Gabriele Di Stefano, Michael Sc...