The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Angelo Oddi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amedeo Cesta, Angelo Oddi, Stephen F. Smith
    Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:742-747 [Conf]
  2. Angelo Oddi, Stephen F. Smith
    Stochastic Procedures for Generating Feasible Schedules. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:308-314 [Conf]
  3. Nicola Policella, Xiaofang Wang, Stephen F. Smith, Angelo Oddi
    Exploiting Temporal Flexibility to Obtain High Quality Schedules. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1199-1204 [Conf]
  4. Roberto Cervoni, Amedeo Cesta, Angelo Oddi
    Maintaining Consistency in Quantitative Temporal Constraint Networks for Planning and Scheduling. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1993, pp:278-289 [Conf]
  5. Amedeo Cesta, Gabriella Cortellessa, Angelo Oddi, Nicola Policella
    A CSP-Based Interactive Decision Aid for Space Mission Planning. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2003, pp:511-522 [Conf]
  6. Amedeo Cesta, Gabriella Cortellessa, Angelo Oddi, Nicola Policella, Angelo Susi
    A Constraint-Based Architecture for Flexible Support to Activity Scheduling. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2001, pp:369-381 [Conf]
  7. Amedeo Cesta, Angelo Oddi
    A Formal Domain Description Language for a Temporal Planner. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1995, pp:255-260 [Conf]
  8. Amedeo Cesta, Angelo Oddi, Angelo Susi
    TimeNetManager - A Software Tool for Generating Random Temporal Networks. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1999, pp:143-154 [Conf]
  9. Angelo Oddi
    A Weakly Backjumping Strategy to Solve Hard Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1997, pp:302-310 [Conf]
  10. Nicola Policella, Amedeo Cesta, Angelo Oddi, Stephen F. Smith
    Schedule Robustness Through Broader Solve and Robustify Search for Partial Order Schedules. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2005, pp:160-172 [Conf]
  11. Roberto Cervoni, Amedeo Cesta, Angelo Oddi
    Managing Dynamic Temporal Constraint Networks. [Citation Graph (0, 0)][DBLP]
    AIPS, 1994, pp:13-18 [Conf]
  12. Amedeo Cesta, Angelo Oddi, Stephen F. Smith
    Profile-Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    AIPS, 1998, pp:214-231 [Conf]
  13. Nicola Policella, Stephen F. Smith, Amedeo Cesta, Angelo Oddi
    Generating Robust Schedules through Temporal Flexibility. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2004, pp:209-218 [Conf]
  14. Amedeo Cesta, Angelo Oddi, Stephen F. Smith
    Scheduling Multi-capacitated Resources Under Complex Temporal Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 1998, pp:465- [Conf]
  15. Angelo Oddi, Nicola Policella, Amedeo Cesta, Gabriella Cortellessa
    Generating High Quality Schedules for a Spacecraft Memory Downlink Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:570-584 [Conf]
  16. Nicola Policella, Angelo Oddi, Stephen F. Smith, Amedeo Cesta
    Generating Robust Partial Order Schedules. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:496-511 [Conf]
  17. Amedeo Cesta, Gabriella Cortellessa, Simone Fratini, Angelo Oddi, Nicola Policella
    Software Companion: The Mexar2 Support to Space Mission Planners. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:622-626 [Conf]
  18. Angelo Oddi
    Solving Multiple Capacitated Scheduling Problems with Tabu Search. [Citation Graph (0, 0)][DBLP]
    ECAI, 1998, pp:520-521 [Conf]
  19. Angelo Oddi, Amedeo Cesta
    Incremental Forward Checking for the Disjunctive Temporal Problem. [Citation Graph (0, 0)][DBLP]
    ECAI, 2000, pp:108-112 [Conf]
  20. María Dolores Rodríguez-Moreno, Angelo Oddi, Daniel Borrajo, Amedeo Cesta, Daniel Meziat
    IPSS: A Hybrid Reasoner for Planning and Scheduling. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:1065-1066 [Conf]
  21. Amedeo Cesta, Angelo Oddi, Stephen F. Smith
    Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    ECP, 1999, pp:213-225 [Conf]
  22. Angelo Oddi, Amedeo Cesta
    A Tabu Search Strategy to Solve Scheduling Problems with Deadlines and Complex Metric Constraints. [Citation Graph (0, 0)][DBLP]
    ECP, 1997, pp:351-363 [Conf]
  23. Roberto Cervoni, Amedeo Cesta, Angelo Oddi
    Maintaining Consistency in a Quantitative Time Manager. [Citation Graph (0, 0)][DBLP]
    ICTAI, 1993, pp:474-475 [Conf]
  24. Amedeo Cesta, Gabriella Cortellessa, Simone Fratini, Angelo Oddi, Nicola Policella
    From Demo to Practice the Mexar Path to Space Operations. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2006, pp:421-431 [Conf]
  25. Amedeo Cesta, Angelo Oddi, Stephen F. Smith
    An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:1022-1033 [Conf]
  26. Amedeo Cesta, Angelo Oddi
    Gaining Efficiency and Flexibility in the Simple Temporal Problem. [Citation Graph (0, 0)][DBLP]
    TIME, 1996, pp:- [Conf]
  27. Angelo Oddi, Amedeo Cesta
    Toward interactive scheduling systems for managing medical resources. [Citation Graph (0, 0)][DBLP]
    Artificial Intelligence in Medicine, 2000, v:20, n:2, pp:113-138 [Journal]
  28. María Dolores Rodríguez-Moreno, Daniel Borrajo, Amedeo Cesta, Angelo Oddi
    Integrating planning and scheduling in workflow domains. [Citation Graph (0, 0)][DBLP]
    Expert Syst. Appl., 2007, v:33, n:2, pp:389-406 [Journal]
  29. Amedeo Cesta, Angelo Oddi, Stephen F. Smith
    A Constraint-Based Method for Project Scheduling with Time Windows. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:1, pp:109-136 [Journal]
  30. Shahram Bahadori, Amedeo Cesta, Giorgio Grisetti, Luca Iocchi, Riccardo Leone, Daniele Nardi, Angelo Oddi, Federico Pecora, Riccardo Rasconi
    RoboCare: Pervasive Intelligence for the Domestic Care of the Elderly. [Citation Graph (0, 0)][DBLP]
    Intelligenza Artificiale, 2004, v:1, n:1, pp:16-21 [Journal]
  31. María Dolores Rodríguez-Moreno, Angelo Oddi, Daniel Borrajo, Amedeo Cesta
    IPSS: A Hybrid Approach to Planning and Scheduling Integration. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2006, v:18, n:12, pp:1681-1695 [Journal]
  32. Angelo Oddi, Nicola Policella, Amedeo Cesta, Stephen F. Smith
    Boosting the Performance of Iterative Flattening Search. [Citation Graph (0, 0)][DBLP]
    AI*IA, 2007, pp:447-458 [Conf]
  33. Nicola Policella, Amedeo Cesta, Angelo Oddi, Stephen F. Smith
    From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2007, v:20, n:3, pp:163-180 [Journal]

  34. An Innovative Product for Space Mission Planning: An A Posteriori Evaluation. [Citation Graph (, )][DBLP]


  35. Solving Resource-Constrained Project Scheduling Problems with Time-Windows Using Iterative Improvement Algorithms. [Citation Graph (, )][DBLP]


  36. Hybrid Variants for Iterative Flattening Search. [Citation Graph (, )][DBLP]


  37. Iterative Flattening Search on RCPSP/max Problems: Recent Developments. [Citation Graph (, )][DBLP]


  38. Continuous Plan Management Support for Space Missions: the RAXEM Case. [Citation Graph (, )][DBLP]


  39. Project Scheduling as a Disjunctive Temporal Problem. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.306secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002