| 2012 | ||
|---|---|---|
| j20 | Noa Agmon, Vikas Agrawal, David W. Aha, Yiannis Aloimonos, Donagh Buckley, Prashant Doshi, Christopher W. Geib, Floriana Grasso, Nancy Green, Benjamin Johnston, Burt Kaliski, Christopher Kiekintveld, Edith Law, Henry Lieberman, Ole J. Mengshoel, Ted Metzler, Joseph Modayil, Douglas W. Oard, Nilufer Onder, Barry O'Sullivan, Katerina Pastra, Doina Precup, Sowmya Ramachandran, Chris Reed, Sanem Sariel Talay, Ted Selker, Lokendra Shastri, Stephen F. Smith, Satinder P. Singh, Siddharth Srivastava, Gita Sukthankar, David C. Uthus, Mary-Anne Williams: Reports of the AAAI 2011 Conference Workshops. AI Magazine 33(1) (2012) | |
| j19 | David W. Hildum, Stephen F. Smith: Scheduling safe movement of air traffic in crowded air spaces. Knowledge Eng. Review 27(3): 309-331 (2012) | |
| c83 | Zachary B. Rubinstein, Stephen F. Smith, Laura Barbulescu: Incremental Management of Oversubscribed Vehicle Schedules in Dynamic Dial-A-Ride Problems. AAAI 2012 | |
| c82 | Xiao-Feng Xie, Stephen F. Smith, Gregory J. Barlow: Coordinated look-ahead scheduling for real-time traffic signal control. AAMAS 2012: 1271-1272 | |
| c81 | Angelo Oddi, Riccardo Rasconi, Amedeo Cesta, Stephen F. Smith: Iterative Improvement Algorithms for the Blocking Job Shop. ICAPS 2012 | |
| c80 | Xiao-Feng Xie, Stephen F. Smith, Gregory J. Barlow: Schedule-Driven Coordination for Real-Time Traffic Network Control. ICAPS 2012 | |
| i2 | Matthew J. Streeter, Stephen F. Smith: New Techniques for Algorithm Portfolio Design. CoRR abs/1206.3286 (2012) | |
| 2011 | ||
| j18 | Xiaofang Wang, Nicola Policella, Stephen F. Smith, Angelo Oddi: Constraint-based methods for scheduling discretionary services. AI Commun. 24(1): 51-73 (2011) | |
| j17 | Angelo Oddi, Riccardo Rasconi, Amedeo Cesta, Stephen F. Smith: Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis. Ann. Math. Artif. Intell. 62(3-4): 371-402 (2011) | |
| c79 | Angelo Oddi, Riccardo Rasconi, Amedeo Cesta, Stephen F. Smith: Iterative Flattening Search for the Flexible Job Shop Scheduling Problem. IJCAI 2011: 1991-1996 | |
| i1 | Stephen F. Smith, Matthew J. Streeter: How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines. CoRR abs/1110.0024 (2011) | |
| 2010 | ||
| j16 | Xiaofang Wang, Laurens G. Debo, Alan Scheller-Wolf, Stephen F. Smith: Design and Analysis of Diagnostic Service Centers. Management Science 56(11): 1873-1890 (2010) | |
| c78 | Laura Barbulescu, Zachary B. Rubinstein, Stephen F. Smith, Terry L. Zimmerman: Distributed coordination of mobile agent teams: the advantage of planning ahead. AAMAS 2010: 1331-1338 | |
| 2009 | ||
| j15 | Nicola Policella, Amedeo Cesta, Angelo Oddi, Stephen F. Smith: Solve-and-robustify. J. Scheduling 12(3): 299-314 (2009) | |
| j14 | Stephen F. Smith, James A. Moore: A Precision, Low-Cost GPS-Based Transmitter Synchronization Scheme for Improved AM Reception. TBC 55(1): 71-78 (2009) | |
| c77 | Anthony Gallagher, Luke Hunsberger, Stephen F. Smith: Just-in-Time Backfilling in Multi-Agent Scheduling. FLAIRS Conference 2009 | |
| c76 | Laura M. Hiatt, Terry L. Zimmerman, Stephen F. Smith, Reid G. Simmons: Strengthening Schedules through Uncertainty Analysis Agents. IJCAI 2009: 175-180 | |
| 2008 | ||
| j13 | David E. Wilkins, Stephen F. Smith, Laurence A. Kramer, Thomas J. Lee, Timothy W. Rauenbusch: Airlift mission monitoring and dynamic rescheduling. Eng. Appl. of AI 21(2): 141-155 (2008) | |
| j12 | Angelo Oddi, Amedeo Cesta, Nicola Policella, Stephen F. Smith: Combining variants of iterative flattening search. Eng. Appl. of AI 21(5): 683-690 (2008) | |
| c75 | Michael Freed, Jaime G. Carbonell, Geoffrey J. Gordon, Jordan Hayes, Brad A. Myers, Daniel P. Siewiorek, Stephen F. Smith, Aaron Steinfeld, Anthony Tomasic: RADAR: A Personal Assistant that Learns to Reduce Email Overload. AAAI 2008: 1287-1293 | |
| c74 | Pradeep Varakantham, Stephen F. Smith: Linear Relaxation Techniques for Task Management in Uncertain Settings. ICAPS 2008: 363-371 | |
| c73 | ||
| c72 | Angelo Oddi, Amedeo Cesta, Nicola Policella, Stephen F. Smith: Hybrid Variants for Iterative Flattening Search. CPAIOR 2008: 355-360 | |
| c71 | Gregory J. Barlow, Stephen F. Smith: A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems. EvoWorkshops 2008: 606-615 | |
| c70 | Anthony Gallagher, Stephen F. Smith: Recovering from Inconsistency in Distributed Simple Temporal Networks. FLAIRS Conference 2008: 549-554 | |
| c69 | Gregory J. Barlow, Choong K. Oh, Stephen F. Smith: Evolving cooperative control on sparsely distributed tasks for UAV teams without global communication. GECCO 2008: 177-184 | |
| c68 | Matthew J. Streeter, Stephen F. Smith: New Techniques for Algorithm Portfolio Design. UAI 2008: 519-527 | |
| 2007 | ||
| j11 | Nicola Policella, Amedeo Cesta, Angelo Oddi, Stephen F. Smith: From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling. AI Commun. 20(3): 163-180 (2007) | |
| c67 | Laurence A. Kramer, Laura Barbulescu, Stephen F. Smith: Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling. AAAI 2007: 1019-1024 | |
| c66 | Matthew J. Streeter, Daniel Golovin, Stephen F. Smith: Combining Multiple Heuristics Online. AAAI 2007: 1197-1203 | |
| c65 | Matthew J. Streeter, Daniel Golovin, Stephen F. Smith: Restart Schedules for Ensembles of Problem Instances. AAAI 2007: 1204-1210 | |
| c64 | Angelo Oddi, Nicola Policella, Amedeo Cesta, Stephen F. Smith: Boosting the Performance of Iterative Flattening Search. AI*IA 2007: 447-458 | |
| c63 | David W. Hildum, Stephen F. Smith: Constructing Conflict-Free Schedules in Space and Time. ICAPS 2007: 184-191 | |
| c62 | Matthew J. Streeter, Stephen F. Smith: Using Decision Procedures Efficiently for Optimization. ICAPS 2007: 312-319 | |
| c61 | Stephen F. Smith, Anthony Gallagher, Terry L. Zimmerman: Distributed management of flexible times schedules. AAMAS 2007: 74 | |
| 2006 | ||
| j10 | Matthew J. Streeter, Stephen F. Smith: How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines. J. Artif. Intell. Res. (JAIR) 26: 247-287 (2006) | |
| c60 | Matthew J. Streeter, Stephen F. Smith: An Asymptotically Optimal Algorithm for the Max k-Armed Bandit Problem. AAAI 2006: 135-142 | |
| c59 | Stephen F. Smith, Anthony Gallagher, Terry L. Zimmerman, Laura Barbulescu, Zachary B. Rubinstein: Multi-Agent Management of Joint Schedules. AAAI Spring Symposium: Distributed Plan and Schedule Management 2006: 128-135 | |
| c58 | Anthony Gallagher, Terry L. Zimmerman, Stephen F. Smith: Incremental Scheduling to Maximize Quality in a Dynamic Environment. ICAPS 2006: 222-232 | |
| c57 | Matthew J. Streeter, Stephen F. Smith: Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling. ICAPS 2006: 324-333 | |
| c56 | Laurence A. Kramer, Stephen F. Smith: Resource Contention Metrics for Oversubscribed Scheduling Problems. ICAPS 2006: 406-409 | |
| c55 | Matthew J. Streeter, Stephen F. Smith: A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem. CP 2006: 560-574 | |
| c54 | Eugene Fink, P. Matthew Jennings, Ulas Bardak, Jean Oh, Stephen F. Smith, Jaime G. Carbonell: Scheduling with Uncertain Resources: Search for a Near-Optimal Solution. SMC 2006: 137-144 | |
| e2 | Derek Long, Stephen F. Smith, Daniel Borrajo, Lee McCluskey (Eds.): Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, ICAPS 2006, Cumbria, UK, June 6-10, 2006. AAAI 2006, isbn 978-1-57735-270-9 | |
| 2005 | ||
| j9 | 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 F. Smith, Biplav Srivastava, Sheila Tejada, Hannes Högni Vilhjálmsson, Kristinn R. Thórisson, Gökhan Tür, José Luis Vicedo González, Holger Wache: The Workshops at the Twentieth National Conference on Artificial Intelligence. AI Magazine 26(4): 102-108 (2005) | |
| j8 | Stephen F. Smith, David W. Hildum, David R. Crimm: Comirem: An Intelligent Form for Resource Management. IEEE Intelligent Systems 20(2): 16-24 (2005) | |
| j7 | Vincent A. Cicirello, Stephen F. Smith: Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics. J. Heuristics 11(1): 5-34 (2005) | |
| c53 | Nicola Policella, Xiaofang Wang, Stephen F. Smith, Angelo Oddi: Exploiting Temporal Flexibility to Obtain High Quality Schedules. AAAI 2005: 1199-1204 | |
| c52 | Vincent A. Cicirello, Stephen F. Smith: The Max K-Armed Bandit: A New Model of Exploration Applied to Search Heuristic Selection. AAAI 2005: 1355-1361 | |
| c51 | Jean Oh, Stephen F. Smith: Calendar Assistants that Learn Preferences. AAAI Spring Symposium: Persistent Assistants: Living and Working with AI 2005: 7-13 | |
| c50 | Nicola Policella, Amedeo Cesta, Angelo Oddi, Stephen F. Smith: Schedule Robustness Through Broader Solve and Robustify Search for Partial Order Schedules. AI*IA 2005: 160-172 | |
| c49 | Matthew J. Streeter, Stephen F. Smith: Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem. ICAPS 2005: 61-70 | |
| c48 | Xiaofang Wang, Stephen F. Smith: Retaining Flexibility to Maximize Quality: When the Scheduler Has the Right to Decide Activity Durations. ICAPS 2005: 212-221 | |
| c47 | Laurence A. Kramer, Stephen F. Smith: Maximizing Availability: A Commitment Heuristic for Oversubscribed Scheduling Problems. ICAPS 2005: 272-280 | |
| 2004 | ||
| j6 | Vincent A. Cicirello, Stephen F. Smith: Wasp-like Agents for Distributed Factory Coordination. Autonomous Agents and Multi-Agent Systems 8(3): 237-266 (2004) | |
| c46 | Pragnesh Jay Modi, Manuela M. Veloso, Stephen F. Smith, Jean Oh: CMRadar: A Personal Assistant Agent for Calendar Management. AAAI 2004: 1020-1021 | |
| c45 | Nicola Policella, Stephen F. Smith, Amedeo Cesta, Angelo Oddi: Generating Robust Schedules through Temporal Flexibility. ICAPS 2004: 209-218 | |
| c44 | Laurence A. Kramer, Stephen F. Smith: Task Swapping for Schedule Improvement: A Broader Analysis. ICAPS 2004: 235-243 | |
| c43 | Pragnesh Jay Modi, Manuela M. Veloso, Stephen F. Smith, Jean Oh: CMRadar: A Personal Assistant Agent for Calendar Management. AOIS 2004: 169-181 | |
| c42 | Vincent A. Cicirello, Stephen F. Smith: Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory. CP 2004: 197-211 | |
| c41 | Nicola Policella, Angelo Oddi, Stephen F. Smith, Amedeo Cesta: Generating Robust Partial Order Schedules. CP 2004: 496-511 | |
| c40 | Alexander Nareyek, Stephen F. Smith, Christian M. Ohler: Local Search for Heuristic Guidance in Tree Search. ECAI 2004: 1069-1070 | |
| c39 | Li Li, Stephen F. Smith: Speculation Agents for Dynamic Multi-Period Continuous Double Auctions in B2B Exchanges. HICSS 2004 | |
| c38 | Jean Oh, Stephen F. Smith: Learning User Preferences in Distributed Calendar Scheduling. PATAT 2004: 3-16 | |
| 2003 | ||
| c37 | 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. AAMAS 2003: 996-997 | |
| c36 | Laurence A. Kramer, Stephen F. Smith: Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems. IJCAI 2003: 1218-1223 | |
| c35 | Li Li, Stephen F. Smith: An agent-based framework for dynamic multi-period continuous double auctions in B2B exchanges. ACM Conference on Electronic Commerce 2003: 204-205 | |
| c34 | Heng Cao, Haifeng Xi, Stephen F. Smith: Supply chain planning: a reinforcement learning approach to production planning in the fabrication/fulfillment manufacturing process. Winter Simulation Conference 2003: 1417-1423 | |
| 2002 | ||
| j5 | Amedeo Cesta, Angelo Oddi, Stephen F. Smith: A Constraint-Based Method for Project Scheduling with Time Windows. J. Heuristics 8(1): 109-136 (2002) | |
| c33 | Vincent A. Cicirello, Stephen F. Smith: Amplification of Search Performance through Randomization of Heuristics. CP 2002: 124-138 | |
| c32 | Vincent A. Cicirello, Stephen F. Smith: Distributed Coordination of Resources via Wasp-Like Agents. WRAC 2002: 71-80 | |
| 2001 | ||
| c31 | Vincent A. Cicirello, Stephen F. Smith: Wasp nests for self-configurable factories. Agents 2001: 473-480 | |
| c30 | Vincent A. Cicirello, Stephen F. Smith: Ant Colony Control for Autonomous Decentralized Shop Floor Routing. ISADS 2001: 383-390 | |
| 2000 | ||
| c29 | Amedeo Cesta, Angelo Oddi, Stephen F. Smith: Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. AAAI/IAAI 2000: 742-747 | |
| c28 | Marcel A. Becker, Stephen F. Smith: Mixed-Initiative Resource Management: The AMC Barrel Allocator. AIPS 2000: 32-41 | |
| c27 | Vincent A. Cicirello, Stephen F. Smith: Modeling GA Performance for Control Parameter Optimization. GECCO 2000: 235-242 | |
| 1999 | ||
| c26 | Amedeo Cesta, Angelo Oddi, Stephen F. Smith: Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem. ECP 1999: 213-225 | |
| c25 | Stephen Y. Chen, Stephen F. Smith: Introducing a New Advantage of Crossover: Commonality-Based Selection. GECCO 1999: 122-128 | |
| c24 | Stephen Y. Chen, Cesar Guerra-Salcedo, Stephen F. Smith: Non-Standard Crossover for a Standard Representation - Commonality-Based Feature Subset Selection. GECCO 1999: 129-134 | |
| c23 | Stephen Y. Chen, Stephen F. Smith: Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling). GECCO 1999: 135-140 | |
| c22 | Amedeo Cesta, Angelo Oddi, Stephen F. Smith: An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows. IJCAI 1999: 1022-1033 | |
| 1998 | ||
| c21 | Amedeo Cesta, Angelo Oddi, Stephen F. Smith: Profile-Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. AIPS 1998: 214-223 | |
| c20 | Amedeo Cesta, Angelo Oddi, Stephen F. Smith: Scheduling Multi-capacitated Resources Under Complex Temporal Constraints. CP 1998: 465 | |
| c19 | Stephen Y. Chen, Stephen F. Smith: Putting the "Genetics" Back into Genetic Algorithms (Reconsidering the Role of Crossover in Hybrid Operators). FOGA 1998: 103-116 | |
| e1 | Reid G. Simmons, Manuela M. Veloso, Stephen F. Smith (Eds.): Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, Pittsburgh, Pennsylvania, USA, 1998. AAAI 1998, isbn 1-57735-052-9 | |
| 1997 | ||
| c18 | Angelo Oddi, Stephen F. Smith: Stochastic Procedures for Generating Feasible Schedules. AAAI/IAAI 1997: 308-314 | |
| c17 | 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. AAAI/IAAI 1997: 1000-1005 | |
| 1996 | ||
| c16 | Cheng-Chung Cheng, Stephen F. Smith: A Constraint Satisfaction Approach to Makespan Scheduling. AIPS 1996: 45-52 | |
| 1994 | ||
| j4 | David Perry Greene, Stephen F. Smith: Using Coverage as a Model Building Constraint in Learning Classifier Systems. Evolutionary Computation 2(1): 67-91 (1994) | |
| c15 | Cheng-Chung Cheng, Stephen F. Smith: Generating Feasible Schedules under Complex Metric Constraints. AAAI 1994: 1086-1091 | |
| c14 | Robert J. Aarts, Stephen F. Smith: A High Performance Scheduler for an Automated Chemistry Workstation. ECAI 1994: 3-7 | |
| 1993 | ||
| j3 | David Perry Greene, Stephen F. Smith: Competition-Based Induction of Decision Models from Examples. Machine Learning 13: 229-257 (1993) | |
| c13 | Stephen F. Smith, Cheng-Chung Cheng: Slack-Based Heuristics for Constraint Satisfaction Scheduling. AAAI 1993: 139-144 | |
| c12 | Stephen F. Smith, Ora Lassila: Configurable Systems for Reactive Production Management. Knowledge-Based Reactive Scheduling 1993: 93-106 | |
| 1992 | ||
| c11 | David Perry Greene, Stephen F. Smith: COGIN: Symbolic Induction with Genetic Algorithms. AAAI 1992: 111-116 | |
| 1991 | ||
| j2 | Karl G. Kempf, Claude Le Pape, Stephen F. Smith, Barry Fox: Issues in the Design of AI-Based Schedulers - Workshop Report. AI Magazine 11(5): 37-46 (1991) | |
| c10 | Hiroaki Kitano, Stephen F. Smith, Tetsuya Higuchi: GA-1: A Parallel Associative Memory Processor for Rule Learning with Genetic Algorithms. ICGA 1991: 311-317 | |
| 1990 | ||
| c9 | A. Safavi, Stephen F. Smith: An evaluation function to compare alternative commitments during manufacturing planning and scheduling. Expert Planning Systems 1990: 22-27 | |
| c8 | Stephen F. Smith, Nicola Muscettola, Dirk C. Matthys, Peng Si Ow, Jean-Yves Potvin: OPIS: An Opportunistic Factory Scheduling System. IEA/AIE (Vol. 1) 1990: 268-274 | |
| 1989 | ||
| c7 | Gary A. Cleveland, Stephen F. Smith: Using Genetic Algorithms to Schedule Flow Shop Releases. ICGA 1989: 160-169 | |
| 1988 | ||
| c6 | ||
| 1987 | ||
| c5 | David Perry Greene, Stephen F. Smith: A Genetic System for Learning Models of Consumer Choice. ICGA 1987: 217-223 | |
| c4 | Nicola Muscettola, Stephen F. Smith: A Probabilistic Framework for Resource-Constrained Multi-Agent Planning. IJCAI 1987: 1063-1066 | |
| c3 | Claude Le Pape, Stephen F. Smith: Management of Temporal Constraints for Factory Scheduling. Temporal Aspects in Information Systems 1987: 159-170 | |
| 1986 | ||
| j1 | 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. AI Magazine 7(4): 45-61 (1986) | |
| 1985 | ||
| c2 | Stephen F. Smith, Peng Si Ow: The Use of Multiple Problem Decompositions in Time Constrained Planning Tasks. IJCAI 1985: 1013-1015 | |
| 1983 | ||
| c1 | Stephen F. Smith: Flexible Learning of Problem Solving Heuristics Through Adaptive Search. IJCAI 1983: 422-425 | |
Colors in the list of coauthors
Last update Sat May 25 17:48:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page