Search

Your search keyword '"Policella, Nicola"' showing total 94 results
Start Over Author "Policella, Nicola"
94 results on '"Policella, Nicola"'

2. On Board Autonomy Operations for OPS-SAT Experiment

Author

Fratini, Simone, Gorfer, Julian, Policella, Nicola, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Wotawa, Franz, editor, Friedrich, Gerhard, editor, Pill, Ingo, editor, Koitz-Hristov, Roxane, editor, and Ali, Moonis, editor

Published
2019
Full Text
View/download PDF

4. A Precedence Constraint Posting Approach

Author

Cesta, Amedeo, Oddi, Angelo, Policella, Nicola, Smith, Stephen F., Bernus, Peter, Series editor, Błażewicz, Jacek, Series editor, Schmidt, Günter J., Series editor, Shaw, Michael J., Series editor, Schwindt, Christoph, editor, and Zimmermann, Jürgen, editor

Published
2015
Full Text
View/download PDF

5. Hybrid Variants for Iterative Flattening Search

Author

Oddi, Angelo, Cesta, Amedeo, Policella, Nicola, Smith, Stephen F., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Perron, Laurent, editor, and Trick, Michael A., editor

Published
2008
Full Text
View/download PDF

7. SEaM: Analyzing Schedule Executability Through Simulation

Author

Rasconi, Riccardo, Policella, Nicola, Cesta, Amedeo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Ali, Moonis, editor, and Dapoigny, Richard, editor

Published
2006
Full Text
View/download PDF

8. Schedule Robustness Through Broader Solve and Robustify Search for Partial Order Schedules

Author

Policella, Nicola, Cesta, Amedeo, Oddi, Angelo, Smith, Stephen F., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Bandini, Stefania, editor, and Manzoni, Sara, editor

Published
2005
Full Text
View/download PDF

10. Generating Robust Partial Order Schedules

Author

Policella, Nicola, Oddi, Angelo, Smith, Stephen F., Cesta, Amedeo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Wallace, Mark, editor

Published
2004
Full Text
View/download PDF

14. Mission Operations and Autonomy

Author

Gao, Yang, primary, Burroughes, Guy, additional, Ocón, Jorge, additional, Fratini, Simone, additional, Policella, Nicola, additional, and Donati, Alessandro, additional

Published
2016
Full Text
View/download PDF

22. A Generalized Timeline Representation, Services, and Interface for Automating Space Mission Operations

Author

Chien, Steve, Johnston, Mark, Frank, Jeremy, Giuliano, Mark, Kavelaars, Alicia, Lenzen, Christoph, and Policella, Nicola

Subjects
Statistics And Probability
Abstract

Most use a timeline based representation for operations modeling. Most model a core set of state, resource types. Most provide similar capabilities on this modeling to enable (semi) automated schedule generation. In this paper we explore the commonality of : representation and services for these timelines. These commonalities offer potential to be harmonized to enable interoperability, re-use.

Published
2012

28. Iterative Flattening Search for Resource Constrained Scheduling

Author

Oddi, Angelo, Cesta, Amedeo, Policella, Nicola, and Smith, Stephen F.

Subjects
FOS: Computer and information sciences, 80101 Adaptive Agents and Intelligent Robotics
Abstract

Iterative flattening search (ifs) is a meta-heuristic strategy for solving multi-capacity scheduling problems. Given an initial solution, ifs iteratively applies: (1) a relaxation-step, in which a subset of scheduling decisions are randomly retracted from the current solution; and (2) a flattening-step, in which a new solution is incrementally recomputed from this partial schedule. Whenever a better solution is found, it is retained, and, upon termination, the best solution found during the search is returned. Prior research has shown ifs to be an effective and scalable heuristic procedure for minimizing schedule makespan in multi-capacity resource settings. In this paper we experimentally investigate the impact on ifs performance of algorithmic variants of the flattening step. The variants considered are distinguished by different computational requirements and correspondingly vary in the type and depth of search performed. The analysis is centered around the idea that given a time bound to the overall optimization procedure, the ifs optimization process is driven by two different and contrasting mechanisms: the random sampling performed by iteratively applying the “relaxation/flattening” cycle and the search conducted within the constituent flattening procedure. On one hand, one might expect that efficiency of the flattening process is key: the faster the flattening procedure, the greater the number of iterations (and number of sampled solutions) for a given time bound; and hence the greater the probability of finding better quality solutions. On the other hand, the use of more accurate (and more costly) flattening procedures can increase the probability of obtaining better quality solutions even if their greater computational cost reduces the number of ifs iterations. Comparative results on well-studied benchmark problems are presented that clarify this tradeoff with respect to previously proposed flattening strategies, identify qualitative guidelines for the design of effective ifs procedures, and suggest some new directions for future work in this area.

Published
2018
Full Text
View/download PDF

32. Mexar2: AI solves mission planner problems

Author

Cesta, Amedeo, Cortellessa, Gabriella, Fratini, Simone, Oddi, Angelo, Denis, Michel, Donati, Alessandro, Policella, Nicola, Rabenau, Erhard, and Schulster, Jonathan

Subjects
Artificial intelligence -- Usage, Problem solving -- Forecasts and trends, Space flight -- Planning, Artificial intelligence, Market trend/market analysis, Company business planning, Business, Computers, Computers and office automation industries, Electronics
Abstract

The utility of artificial intelligence for solving problems pertaining to the planning of space flights is discussed.

Published
2007

37. Anatomy of a Scheduling Competition

Author

Benedetti, Marco, Pecora, Federico, Policella, Nicola, Parmentier, Yannick, Laboratoire d'Informatique Fondamentale d'Orléans (LIFO), Ecole Nationale Supérieure d'Ingénieurs de Bourges-Université d'Orléans (UO), AASS Mobile Robotics Lab, School of Science and Technology (aass), Örebro University, European Space Operations Center (ESOC), and European Space Agency (ESA)

Subjects
[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2007

38. Scheduling with Uncertainty: A Proactive Approach using Partial Order Schedules

Author

Policella, Nicola and Cesta, Amedeo

Subjects
constraint programming, Settori Disciplinari MIUR::Ingegneria industriale e dell'informazione::SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI, Ingegneria industriale e dell'informazione::SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI [Settori Disciplinari MIUR], uncertainty, project scheduling
Abstract

Amedeo Cesta, Umberto Nanni, Andrea Schaerf, Marco Schaerf

Published
2005

Catalog

Books, media, physical & digital resources
See catalog results