The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephen F. Smith: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peng Si Ow, Stephen F. Smith, Alfred Thirlez
    Reactive Plan Revision. [Citation Graph (1, 0)][DBLP]
    AAAI, 1988, pp:77-82 [Conf]
  2. Stephen F. Smith
    Flexible Learning of Problem Solving Heuristics Through Adaptive Search. [Citation Graph (1, 0)][DBLP]
    IJCAI, 1983, pp:422-425 [Conf]
  3. Stephen F. Smith, Mark S. Fox, Peng Si Ow
    Constructing and Maintaining Detailed Production Plans: Investigations into the Development of Knowledge-Based Factory Scheduling Systems. [Citation Graph (1, 0)][DBLP]
    AI Magazine, 1986, v:7, n:4, pp:45-61 [Journal]
  4. 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]
  5. Cheng-Chung Cheng, Stephen F. Smith
    Generating Feasible Schedules under Complex Metric Constraints. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:1086-1091 [Conf]
  6. Vincent A. Cicirello, Stephen F. Smith
    The Max K-Armed Bandit: A New Model of Exploration Applied to Search Heuristic Selection. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:1355-1361 [Conf]
  7. David Perry Greene, Stephen F. Smith
    COGIN: Symbolic Induction with Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:111-116 [Conf]
  8. David W. Hildum, Norman M. Sadeh, Thomas J. Laliberty, John McA'Nulty, Stephen F. Smith, Dag Kjenstad
    Blackboard Agents for Mixed-Initiative Management of Integrated Process-Planning/Production-Scheduling Solutions Across the Supply Chain. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:1000-1005 [Conf]
  9. Pragnesh Jay Modi, Manuela M. Veloso, Stephen F. Smith, Jean Oh
    CMRadar: A Personal Assistant Agent for Calendar Management. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:1020-1021 [Conf]
  10. Angelo Oddi, Stephen F. Smith
    Stochastic Procedures for Generating Feasible Schedules. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:308-314 [Conf]
  11. 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]
  12. Stephen F. Smith, Cheng-Chung Cheng
    Slack-Based Heuristics for Constraint Satisfaction Scheduling. [Citation Graph (0, 0)][DBLP]
    AAAI, 1993, pp:139-144 [Conf]
  13. Matthew J. Streeter, Stephen F. Smith
    An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  14. Vincent A. Cicirello, Stephen F. Smith
    Wasp nests for self-configurable factories. [Citation Graph (0, 0)][DBLP]
    Agents, 2001, pp:473-480 [Conf]
  15. 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]
  16. Marcel A. Becker, Stephen F. Smith
    Mixed-Initiative Resource Management: The AMC Barrel Allocator. [Citation Graph (0, 0)][DBLP]
    AIPS, 2000, pp:32-41 [Conf]
  17. 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]
  18. Cheng-Chung Cheng, Stephen F. Smith
    A Constraint Satisfaction Approach to Makespan Scheduling. [Citation Graph (0, 0)][DBLP]
    AIPS, 1996, pp:45-52 [Conf]
  19. Laurence A. Kramer, Stephen F. Smith
    Task Swapping for Schedule Improvement: A Broader Analysis. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2004, pp:235-243 [Conf]
  20. Laurence A. Kramer, Stephen F. Smith
    Maximizing Availability: A Commitment Heuristic for Oversubscribed Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:272-280 [Conf]
  21. 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]
  22. A. Safavi, Stephen F. Smith
    An evaluation function to compare alternative commitments during manufacturing planning and scheduling. [Citation Graph (0, 0)][DBLP]
    Expert Planning Systems, 1990, pp:22-27 [Conf]
  23. Matthew J. Streeter, Stephen F. Smith
    Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:61-70 [Conf]
  24. Xiaofang Wang, Stephen F. Smith
    Retaining Flexibility to Maximize Quality: When the Scheduler Has the Right to Decide Activity Durations. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:212-221 [Conf]
  25. Pragnesh Jay Modi, Manuela M. Veloso, Stephen F. Smith, Jean Oh
    CMRadar: A Personal Assistant Agent for Calendar Management. [Citation Graph (0, 0)][DBLP]
    AOIS, 2004, pp:169-181 [Conf]
  26. Dani Goldberg, Vincent A. Cicirello, M. Bernardine Dias, Reid G. Simmons, Stephen F. Smith, Anthony Stentz
    Task allocation using a distributed market-based planning mechanism. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2003, pp:996-997 [Conf]
  27. 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]
  28. Vincent A. Cicirello, Stephen F. Smith
    Amplification of Search Performance through Randomization of Heuristics. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:124-138 [Conf]
  29. Vincent A. Cicirello, Stephen F. Smith
    Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:197-211 [Conf]
  30. 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]
  31. Matthew J. Streeter, Stephen F. Smith
    A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:560-574 [Conf]
  32. Robert J. Aarts, Stephen F. Smith
    A High Performance Scheduler for an Automated Chemistry Workstation. [Citation Graph (0, 0)][DBLP]
    ECAI, 1994, pp:3-7 [Conf]
  33. Alexander Nareyek, Stephen F. Smith, Christian M. Ohler
    Local Search for Heuristic Guidance in Tree Search. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:1069-1070 [Conf]
  34. 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]
  35. Stephen Y. Chen, Stephen F. Smith
    Putting the "Genetics" Back into Genetic Algorithms (Reconsidering the Role of Crossover in Hybrid Operators). [Citation Graph (0, 0)][DBLP]
    FOGA, 1998, pp:103-116 [Conf]
  36. Stephen Y. Chen, Cesar Guerra-Salcedo, Stephen F. Smith
    Non-Standard Crossover for a Standard Representation - Commonality-Based Feature Subset Selection. [Citation Graph (0, 0)][DBLP]
    GECCO, 1999, pp:129-134 [Conf]
  37. Stephen Y. Chen, Stephen F. Smith
    Introducing a New Advantage of Crossover: Commonality-Based Selection. [Citation Graph (0, 0)][DBLP]
    GECCO, 1999, pp:122-128 [Conf]
  38. Stephen Y. Chen, Stephen F. Smith
    Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling). [Citation Graph (0, 0)][DBLP]
    GECCO, 1999, pp:135-140 [Conf]
  39. Vincent A. Cicirello, Stephen F. Smith
    Modeling GA Performance for Control Parameter Optimization. [Citation Graph (0, 0)][DBLP]
    GECCO, 2000, pp:235-242 [Conf]
  40. Li Li, Stephen F. Smith
    Speculation Agents for Dynamic Multi-Period Continuous Double Auctions in B2B Exchanges. [Citation Graph (0, 0)][DBLP]
    HICSS, 2004, pp:- [Conf]
  41. Gary A. Cleveland, Stephen F. Smith
    Using Genetic Algorithms to Schedule Flow Shop Releases. [Citation Graph (0, 0)][DBLP]
    ICGA, 1989, pp:160-169 [Conf]
  42. David Perry Greene, Stephen F. Smith
    A Genetic System for Learning Models of Consumer Choice. [Citation Graph (0, 0)][DBLP]
    ICGA, 1987, pp:217-223 [Conf]
  43. Hiroaki Kitano, Stephen F. Smith, Tetsuya Higuchi
    GA-1: A Parallel Associative Memory Processor for Rule Learning with Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
    ICGA, 1991, pp:311-317 [Conf]
  44. Stephen F. Smith, Nicola Muscettola, Dirk C. Matthys, Peng Si Ow, Jean-Yves Potvin
    OPIS: An Opportunistic Factory Scheduling System. [Citation Graph (0, 0)][DBLP]
    IEA/AIE (Vol. 1), 1990, pp:268-274 [Conf]
  45. Stephen F. Smith, Ora Lassila
    Configurable Systems for Reactive Production Management. [Citation Graph (0, 0)][DBLP]
    Knowledge-Based Reactive Scheduling, 1993, pp:93-106 [Conf]
  46. 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]
  47. Laurence A. Kramer, Stephen F. Smith
    Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1218-1223 [Conf]
  48. Nicola Muscettola, Stephen F. Smith
    A Probabilistic Framework for Resource-Constrained Multi-Agent Planning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1987, pp:1063-1066 [Conf]
  49. Stephen F. Smith, Peng Si Ow
    The Use of Multiple Problem Decompositions in Time Constrained Planning Tasks. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1985, pp:1013-1015 [Conf]
  50. Vincent A. Cicirello, Stephen F. Smith
    Ant Colony Control for Autonomous Decentralized Shop Floor Routing. [Citation Graph (0, 0)][DBLP]
    ISADS, 2001, pp:383-390 [Conf]
  51. Jean Oh, Stephen F. Smith
    Learning User Preferences in Distributed Calendar Scheduling. [Citation Graph (0, 0)][DBLP]
    PATAT, 2004, pp:3-16 [Conf]
  52. Li Li, Stephen F. Smith
    An agent-based framework for dynamic multi-period continuous double auctions in B2B exchanges. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2003, pp:204-205 [Conf]
  53. Claude Le Pape, Stephen F. Smith
    Management of Temporal Constraints for Factory Scheduling. [Citation Graph (0, 0)][DBLP]
    Temporal Aspects in Information Systems, 1987, pp:159-170 [Conf]
  54. Vincent A. Cicirello, Stephen F. Smith
    Distributed Coordination of Resources via Wasp-Like Agents. [Citation Graph (0, 0)][DBLP]
    WRAC, 2002, pp:71-80 [Conf]
  55. Heng Cao, Haifeng Xi, Stephen F. Smith
    Supply chain planning: a reinforcement learning approach to production planning in the fabrication/fulfillment manufacturing process. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2003, pp:1417-1423 [Conf]
  56. Vincent A. Cicirello, Stephen F. Smith
    Wasp-like Agents for Distributed Factory Coordination. [Citation Graph (0, 0)][DBLP]
    Autonomous Agents and Multi-Agent Systems, 2004, v:8, n:3, pp:237-266 [Journal]
  57. Diego Mollá Aliod, Eduardo Alonso, Srinivas Bangalore, Joseph E. Beck, Bir Bhanu, Jim Blythe, Mark S. Boddy, Amedeo Cesta, Marko Grobelnik, Dilek Z. Hakkani-Tür, Sanda M. Harabagiu, Alain Léger, Deborah L. McGuinness, Stacy Marsella, Natasa Milic-Frayling, Dunja Mladenic, Daniel Oblinger, Paul E. Rybski, Pavel Shvaiko, Stephen Smith, Biplav Srivastava, Sheila Tejada, Hannes Högni Vilhjálmsson, Kristinn R. Thórisson, Gökhan Tür, Holger Wache
    The Workshops at the Twentieth National Conference on Artificial Intelligence. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2005, v:26, n:4, pp:102-108 [Journal]
  58. Karl G. Kempf, Claude Le Pape, Stephen F. Smith, Barry Fox
    Issues in the Design of AI-Based Schedulers - Workshop Report. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 1991, v:11, n:5, pp:37-46 [Journal]
  59. David Perry Greene, Stephen F. Smith
    Using Coverage as a Model Building Constraint in Learning Classifier Systems. [Citation Graph (0, 0)][DBLP]
    Evolutionary Computation, 1994, v:2, n:1, pp:67-91 [Journal]
  60. Stephen F. Smith, David W. Hildum, David R. Crimm
    Comirem: An Intelligent Form for Resource Management. [Citation Graph (0, 0)][DBLP]
    IEEE Intelligent Systems, 2005, v:20, n:2, pp:16-24 [Journal]
  61. 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]
  62. Vincent A. Cicirello, Stephen F. Smith
    Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2005, v:11, n:1, pp:5-34 [Journal]
  63. David Perry Greene, Stephen F. Smith
    Competition-Based Induction of Decision Models from Examples. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1993, v:13, n:, pp:229-257 [Journal]
  64. Matthew J. Streeter, Daniel Golovin, Stephen F. Smith
    Combining Multiple Heuristics Online. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1197-1203 [Conf]
  65. Laurence A. Kramer, Laura Barbulescu, Stephen F. Smith
    Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1019-1024 [Conf]
  66. Matthew J. Streeter, Daniel Golovin, Stephen F. Smith
    Restart Schedules for Ensembles of Problem Instances. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:1204-1210 [Conf]
  67. 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]
  68. Anthony Gallagher, Terry L. Zimmerman, Stephen F. Smith
    Incremental Scheduling to Maximize Quality in a Dynamic Environment. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:222-232 [Conf]
  69. Laurence A. Kramer, Stephen F. Smith
    Resource Contention Metrics for Oversubscribed Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:406-409 [Conf]
  70. Matthew J. Streeter, Stephen F. Smith
    Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2006, pp:324-333 [Conf]
  71. 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]
  72. Matthew J. Streeter, Stephen F. Smith
    How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2006, v:26, n:, pp:247-287 [Journal]

  73. Using Decision Procedures Efficiently for Optimization. [Citation Graph (, )][DBLP]


  74. Constructing Conflict-Free Schedules in Space and Time. [Citation Graph (, )][DBLP]


  75. Linear Relaxation Techniques for Task Management in Uncertain Settings. [Citation Graph (, )][DBLP]


  76. A few good agents: multi-agent social learning. [Citation Graph (, )][DBLP]


  77. Distributed management of flexible times schedules. [Citation Graph (, )][DBLP]


  78. Distributed coordination of mobile agent teams: the advantage of planning ahead. [Citation Graph (, )][DBLP]


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


  80. A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems. [Citation Graph (, )][DBLP]


  81. Recovering from Inconsistency in Distributed Simple Temporal Networks. [Citation Graph (, )][DBLP]


  82. Just-in-Time Backfilling in Multi-Agent Scheduling. [Citation Graph (, )][DBLP]


  83. Evolving cooperative control on sparsely distributed tasks for UAV teams without global communication. [Citation Graph (, )][DBLP]


  84. Strengthening Schedules through Uncertainty Analysis Agents. [Citation Graph (, )][DBLP]


  85. New Techniques for Algorithm Portfolio Design. [Citation Graph (, )][DBLP]


Search in 1.319secs, Finished in 1.326secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002