default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWheeler Ruml
Person information
- affiliation: University of New Hampshire, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j16]Benjamin A. Miller
, Zohair Shafi, Wheeler Ruml, Yevgeniy Vorobeychik, Tina Eliassi-Rad, Scott Alfeld:
Attacking Shortest Paths by Cutting Edges. ACM Trans. Knowl. Discov. Data 18(2): 35:1-35:42 (2024)- [c100]Sofia Lemons, Wheeler Ruml, Robert C. Holte, Carlos Linares López:
Rectangle Search: An Anytime Beam Search. AAAI 2024: 20751-20758 - [c99]Andrew Coles, Erez Karpas, Andrey Lavrinenko, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Planning and Acting While the Clock Ticks. ICAPS 2024: 95-103 - [c98]Issa K. Hanou, Devin Wild Thomas, Wheeler Ruml, Mathijs de Weerdt:
Replanning in Advance for Instant Delay Recovery in Multi-Agent Applications: Rerouting Trains in a Railway Hub. ICAPS 2024: 258-266 - [c97]Devin Wild Thomas, Wheeler Ruml, Solomon Eyal Shimony:
Real-time Safe Interval Path Planning. SOCS 2024: 161-169 - [c96]Stephen Wissow, Fanhao Yu, Wheeler Ruml:
Tunable Suboptimal Heuristic Search. SOCS 2024: 170-178 - [c95]Sean Mariasin, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Evaluating Distributional Predictions of Search Time: Put Up or Shut Up Games (Extended Abstract). SOCS 2024: 277-278 - [i13]Andrew Coles, Erez Karpas, Andrey Lavrinenko, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Planning and Acting While the Clock Ticks. CoRR abs/2403.14796 (2024) - 2023
- [c94]Amihay Elboher, Ava Bensoussan, Erez Karpas, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony:
A Formal Metareasoning Model of Concurrent Planning and Execution. AAAI 2023: 12427-12435 - [c93]Bryan McKenney, Wheeler Ruml:
General-Purpose Planning Algorithms in the Card Game Duelyst II. CoG 2023: 1-4 - [c92]Naiqian Zhang, Daroc Alden, Dongpeng Xu, Shuai Wang, Trent Jaeger, Wheeler Ruml:
No Free Lunch: On the Increased Code Reuse Attack Surface of Obfuscated Programs. DSN 2023: 313-326 - [e4]Roman Barták, Wheeler Ruml, Oren Salzman:
Sixteenth International Symposium on Combinatorial Search, SOCS 2023, Prague, Czech Republic, July 14-16, 2023. AAAI Press 2023 [contents] - [i12]Amihay Elboher, Ava Bensoussan, Erez Karpas, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony:
A Formal Metareasoning Model of Concurrent Planning and Execution. CoRR abs/2303.02664 (2023) - [i11]Benjamin A. Miller, Zohair Shafi, Wheeler Ruml, Yevgeniy Vorobeychik, Tina Eliassi-Rad, Scott Alfeld:
Defense Against Shortest Path Attacks. CoRR abs/2305.19083 (2023) - [i10]Sofia Lemons, Wheeler Ruml, Robert C. Holte, Carlos Linares López:
Rectangle Search: An Anytime Beam Search (Extended Version). CoRR abs/2312.12554 (2023) - 2022
- [c91]Maximilian Fickert, Tianyi Gu, Wheeler Ruml:
New Results in Bounded-Suboptimal Search. AAAI 2022: 10166-10173 - [c90]Sofia Lemons, Carlos Linares López, Robert C. Holte, Wheeler Ruml:
Beam Search: Faster and Monotonic. ICAPS 2022: 222-230 - [c89]Tianyi Gu, Wheeler Ruml, Shahaf S. Shperberg, Solomon Eyal Shimony, Erez Karpas:
When to Commit to an Action in Online Planning and Search. SOCS 2022: 83-90 - [c88]Devin Wild Thomas, Tianyi Gu, Wheeler Ruml, Solomon Eyal Shimony:
Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract). SOCS 2022: 323-325 - [i9]Sofia Lemons, Carlos Linares López, Robert C. Holte, Wheeler Ruml:
Beam Search: Faster and Monotonic. CoRR abs/2204.02929 (2022) - [i8]Benjamin A. Miller, Zohair Shafi, Wheeler Ruml, Yevgeniy Vorobeychik, Tina Eliassi-Rad, Scott Alfeld:
Attacking Shortest Paths by Cutting Edges. CoRR abs/2211.11141 (2022) - 2021
- [c87]Maximilian Fickert, Ivan Gavran, Ivan Fedotov, Jörg Hoffmann, Rupak Majumdar, Wheeler Ruml:
Choosing the Initial State for Online Replanning. AAAI 2021: 12311-12319 - [c86]Jiaoyang Li, Wheeler Ruml, Sven Koenig:
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. AAAI 2021: 12353-12362 - [c85]Shahaf S. Shperberg, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony:
Situated Temporal Planning Using Deadline-aware Metareasoning. ICAPS 2021: 340-348 - [c84]Maximilian Fickert, Tianyi Gu, Wheeler Ruml:
Bounded-cost Search Using Estimates of Uncertainty. IJCAI 2021: 1675-1681 - [c83]Kevin C. Gall, Wheeler Ruml, Sarah Keren:
Active Goal Recognition Design. IJCAI 2021: 4062-4068 - [c82]Benjamin A. Miller, Zohair Shafi, Wheeler Ruml, Yevgeniy Vorobeychik, Tina Eliassi-Rad, Scott Alfeld:
PATHATTACK: Attacking Shortest Paths in Complex Networks. ECML/PKDD (2) 2021: 532-547 - [i7]Benjamin A. Miller, Zohair Shafi, Wheeler Ruml, Yevgeniy Vorobeychik, Tina Eliassi-Rad, Scott Alfeld:
PATHATTACK: Attacking Shortest Paths in Complex Networks. CoRR abs/2104.03761 (2021) - [i6]Benjamin A. Miller, Zohair Shafi, Wheeler Ruml, Yevgeniy Vorobeychik, Tina Eliassi-Rad, Scott Alfeld:
Optimal Edge Weight Perturbations to Attack Shortest Paths. CoRR abs/2107.03347 (2021) - 2020
- [c81]Kevin C. Gall, Bence Cserna, Wheeler Ruml:
Envelope-Based Approaches to Real-Time Heuristic Search. AAAI 2020: 2351-2358 - [c80]Maximilian Fickert, Tianyi Gu, Leonhard Staut, Wheeler Ruml, Jörg Hoffmann, Marek Petrik:
Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search. AAAI 2020: 9827-9834 - [c79]Shahaf S. Shperberg, Andrew Coles, Erez Karpas, Solomon Eyal Shimony, Wheeler Ruml:
Trading Plan Cost for Timeliness in Situated Temporal Planning. IJCAI 2020: 4176-4182 - [c78]Matthew G. Westbrook, Wheeler Ruml:
Anytime Kinodynamic Motion Planning using Region-Guided Search. IROS 2020: 6789-6796 - [i5]Jiaoyang Li, Wheeler Ruml, Sven Koenig:
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. CoRR abs/2010.01367 (2020)
2010 – 2019
- 2019
- [c77]Bence Cserna, William J. Doyle, Tianyi Gu, Wheeler Ruml:
Safe Temporal Planning for Urban Driving. SafeAI@AAAI 2019 - [c76]Andrew Mitchell, Wheeler Ruml, Fabian Spaniol, Jörg Hoffmann, Marek Petrik:
Real-Time Planning as Decision-Making under Uncertainty. AAAI 2019: 2338-2345 - [c75]Shahaf S. Shperberg, Andrew Coles, Bence Cserna, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony:
Allocating Planning Effort When Actions Expire. AAAI 2019: 2371-2378 - [c74]Rebecca Eifler, Maximilian Fickert, Jörg Hoffmann, Wheeler Ruml:
Refining Abstraction Heuristics during Real-Time Planning. AAAI 2019: 7578-7585 - [c73]Michael Cashmore, Andrew Coles, Bence Cserna, Erez Karpas, Daniele Magazzeni, Wheeler Ruml:
Replanning for Situated Robots. ICAPS 2019: 665-673 - [c72]Jingwei Chen, Nathan R. Sturtevant, William J. Doyle, Wheeler Ruml:
Revisiting Suboptimal Search. SOCS 2019: 18-25 - [c71]Chao Chi Cheng, Wheeler Ruml:
Real-Time Heuristic Search in Dynamic Environments. SOCS 2019: 168-169 - [c70]Bence Cserna, Kevin C. Gall, Wheeler Ruml:
Improved Safe Real-Time Heuristic Search. SOCS 2019: 172-173 - [i4]Bence Cserna, Kevin C. Gall, Wheeler Ruml:
Improved Safe Real-time Heuristic Search. CoRR abs/1905.06402 (2019) - 2018
- [j15]Matthew Hatem, Ethan Burns, Wheeler Ruml:
Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search. J. Artif. Intell. Res. 62: 233-268 (2018) - [c69]Alison Paredes, Wheeler Ruml:
Real-Time Planning for Traffic Signal Control. AAAI Workshops 2018: 189-193 - [c68]Bence Cserna, William J. Doyle, Jordan S. Ramsdell, Wheeler Ruml:
Avoiding Dead Ends in Real-Time Heuristic Search. AAAI 2018: 1306-1313 - [c67]Michael Cashmore, Andrew Coles, Bence Cserna, Erez Karpas, Daniele Magazzeni, Wheeler Ruml:
Situated Planning for Execution Under Temporal Constraints. AAAI Spring Symposia 2018 - [c66]Michael Cashmore, Andrew Coles, Bence Cserna, Erez Karpas, Daniele Magazzeni, Wheeler Ruml:
Temporal Planning while the Clock Ticks. ICAPS 2018: 39-46 - [c65]Shane Kochvi, Wheeler Ruml:
Does Fast Beat Thorough? Comparing RTAA* and LSS-LRTA. SOCS 2018: 163-167 - 2017
- [c64]Bence Cserna, Wheeler Ruml, Jeremy Frank:
Planning Time to Think: Metareasoning for On-Line Planning with Durative Actions. ICAPS 2017: 56-60 - [c63]Scott Kiesel, Tianyi Gu, Wheeler Ruml:
An effort bias for sampling-based motion planning. IROS 2017: 2864-2871 - [c62]Bence Cserna, Marek Petrik, Reazul Hasan Russel, Wheeler Ruml:
Value Directed Exploration in Multi-Armed Bandits with Structured Priors. UAI 2017 - [i3]Bence Cserna, Marek Petrik, Reazul Hasan Russel, Wheeler Ruml:
Value Directed Exploration in Multi-Armed Bandits with Structured Priors. CoRR abs/1704.03926 (2017) - 2016
- [j14]Christopher Makoto Wilt, Wheeler Ruml:
Effective Heuristics for Suboptimal Best-First Search. J. Artif. Intell. Res. 57: 273-306 (2016) - [c61]Bence Cserna, Mike Bogochow, Stephen Chambers, Michaela Tremblay, Sammie Katt, Wheeler Ruml:
Anytime versus Real-Time Heuristic Search for On-Line Planning. SOCS 2016: 131-132 - 2015
- [j13]Scott Kiesel, Ethan Burns, Wheeler Ruml:
Achieving Goals Quickly Using Real-time Search: Experimental Results in Video Games. J. Artif. Intell. Res. 54: 123-158 (2015) - [c60]Matthew Hatem, Scott Kiesel, Wheeler Ruml:
Recursive Best-First Search with Bounded Overhead. AAAI 2015: 1151-1157 - [c59]Roni Stern, Scott Kiesel, Rami Puzis, Ariel Felner, Wheeler Ruml:
Max Is More than Min: Solving Maximization Problems with Heuristic Search. IJCAI 2015: 4324-4330 - [c58]Christopher Makoto Wilt, Wheeler Ruml:
Speedy versus Greedy Search. IJCAI 2015: 4331-4338 - [c57]Dylan O'Ceallaigh, Wheeler Ruml:
Metareasoning in Real-Time Heuristic Search. SOCS 2015: 87-95 - [c56]Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel, Wheeler Ruml:
Solving the Snake in the Box Problem with Heuristic Search: First Results. SOCS 2015: 96-104 - [c55]Christopher Makoto Wilt, Wheeler Ruml:
Building a Heuristic for Greedy Search. SOCS 2015: 131-140 - 2014
- [j12]Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
The Fifth Annual Symposium on Combinatorial Search. AI Commun. 27(4): 327-328 (2014) - [j11]Jarad Cannon, Kevin Rose, Wheeler Ruml:
Real-time heuristic search for motion planning with dynamic obstacles. AI Commun. 27(4): 345-362 (2014) - [c54]Matthew Hatem, Wheeler Ruml:
Simpler Bounded Suboptimal Search. AAAI 2014: 856-862 - [c53]Matthew Hatem, Wheeler Ruml:
Bounded Suboptimal Search in Linear Space: New Results. SOCS 2014: 89-96 - [c52]Roni Tzvi Stern, Scott Kiesel, Rami Puzis, Ariel Felner, Wheeler Ruml:
Max is More than Min: Solving Maximization Problems with Heuristic Search. SOCS 2014: 148-156 - [c51]Christopher Makoto Wilt, Wheeler Ruml:
Speedy Versus Greedy Search. SOCS 2014: 184-192 - [e3]Steve A. Chien, Minh Binh Do, Alan Fern, Wheeler Ruml:
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2014, Portsmouth, New Hampshire, USA, June 21-26, 2014. AAAI 2014, ISBN 978-1-57735-660-8 [contents] - [i2]Ethan Burns, Sofia Lemons, Wheeler Ruml, Rong Zhou:
Best-First Heuristic Search for Multicore Machines. CoRR abs/1401.3861 (2014) - [i1]Wheeler Ruml, Minh Binh Do, Rong Zhou, Markus P. J. Fromherz:
On-line Planning and Scheduling: An Application to Controlling Modular Printers. CoRR abs/1401.3875 (2014) - 2013
- [j10]Lara S. Crawford, Minh Binh Do, Wheeler Ruml, Haitham A. Hindi, Craig Eldershaw, Rong Zhou, Lukas D. Kuhn, Markus P. J. Fromherz, David Biegelsen, Johan de Kleer, Daniel Larner:
On-Line Reconfigurable Machines. AI Mag. 34(3): 73-88 (2013) - [j9]Ethan Burns, Wheeler Ruml:
Iterative-deepening search with on-line tree size prediction. Ann. Math. Artif. Intell. 69(2): 183-205 (2013) - [j8]Ethan Burns, Wheeler Ruml, Minh Binh Do:
Heuristic Search When Time Matters. J. Artif. Intell. Res. 47: 697-740 (2013) - [c50]Matthew Hatem, Wheeler Ruml:
External Memory Best-First Search for Multiple Sequence Alignment. AAAI 2013: 409-416 - [c49]Christopher Makoto Wilt, Wheeler Ruml:
Robust Bidirectional Search via Heuristic Improvement. AAAI 2013: 954-961 - [c48]Ethan Burns, Scott Kiesel, Wheeler Ruml:
Experimental Real-Time Heuristic Search Results in a Video Game. SOCS 2013: 47-54 - [c47]Matthew Hatem, Roni Stern, Wheeler Ruml:
Bounded Suboptimal Heuristic Search in Linear Space. SOCS 2013: 98-104 - 2012
- [c46]Nathan R. Sturtevant, Ariel Felner, Maxim Likhachev, Wheeler Ruml:
Heuristic Search Comes of Age. AAAI 2012: 2186-2191 - [c45]Ethan Burns, J. Benton, Wheeler Ruml, Sung Wook Yoon, Minh Binh Do:
Anticipatory On-Line Planning. ICAPS 2012 - [c44]Scott Kiesel, Ethan Burns, Christopher Makoto Wilt, Wheeler Ruml:
Integrating Vehicle Routing and Motion Planning. ICAPS 2012 - [c43]Jordan Tyler Thayer, Roni Stern, Ariel Felner, Wheeler Ruml:
Faster Bounded-Cost Search Using Inadmissible Estimates. ICAPS 2012 - [c42]Ethan Burns, Wheeler Ruml:
Iterative-Deepening Search with On-Line Tree Size Prediction. LION 2012: 1-15 - [c41]Ethan Andrew Burns, Matthew Hatem, Michael J. Leighton, Wheeler Ruml:
Implementing Fast Heuristic Search Code. SOCS 2012: 25-32 - [c40]Jarad Cannon, Kevin Rose, Wheeler Ruml:
Real-Time Motion Planning with Dynamic Obstacles. SOCS 2012: 33-40 - [c39]Christopher Makoto Wilt, Wheeler Ruml:
When Does Weighted A* Fail? SOCS 2012: 137-144 - [c38]Scott Kiesel, Ethan Burns, Wheeler Ruml:
Abstraction-Guided Sampling for Motion Planning. SOCS 2012: 162-163 - [e2]Daniel Borrajo, Ariel Felner, Richard E. Korf, Maxim Likhachev, Carlos Linares López, Wheeler Ruml, Nathan R. Sturtevant:
Proceedings of the Fifth Annual Symposium on Combinatorial Search, SOCS 2012, Niagara Falls, Ontario, Canada, July 19-21, 2012. AAAI Press 2012 [contents] - 2011
- [j7]Wheeler Ruml, Minh Binh Do, Rong Zhou, Markus P. J. Fromherz:
On-line Planning and Scheduling: An Application to Controlling Modular Printers. J. Artif. Intell. Res. 40: 415-468 (2011) - [c37]Matthew Hatem, Ethan Burns, Wheeler Ruml:
Heuristic Search for Large Problems With Real Costs. AAAI 2011: 30-35 - [c36]Jordan Tyler Thayer, Austin J. Dionne, Wheeler Ruml:
Learning Inadmissible Heuristics During Search. ICAPS 2011 - [c35]Jordan Tyler Thayer, Wheeler Ruml:
Bounded Suboptimal Search: A Direct Approach Using Inadmissible Estimates. IJCAI 2011: 674-679 - [c34]David Biegelsen, Lara S. Crawford, Minh Do, Dave Duff, Craig Eldershaw, Markus P. J. Fromherz, Haitham A. Hindi, Gregory Kott, Daniel Larner, Barry Mandel, Steven Moore, Bryan Preas, Wheeler Ruml, Greg Schmitz, Lars Swartz, Rong Zhou:
Integrated parallel printing systems with hypermodular architecture. Parallel Processing for Imaging Applications 2011: 787206 - [c33]Austin J. Dionne, Jordan Tyler Thayer, Wheeler Ruml:
Deadline-Aware Search Using On-Line Measures of Behavior. SOCS 2011: 39-46 - [c32]Michael J. Leighton, Wheeler Ruml, Robert C. Holte:
Faster Optimal and Suboptimal Hierarchical Search. SOCS 2011: 92-99 - [c31]Kevin Rose, Ethan Burns, Wheeler Ruml:
Best-First Search for Bounded-Depth Trees. SOCS 2011: 134-141 - [c30]Christopher Makoto Wilt, Wheeler Ruml:
Cost-Based Heuristic Search Is Sensitive to the Ratio of Operator Costs. SOCS 2011: 172-179 - 2010
- [j6]Ethan Burns, Sofia Lemons, Wheeler Ruml, Rong Zhou:
Best-First Heuristic Search for Multicore Machines. J. Artif. Intell. Res. 39: 689-743 (2010) - [c29]Ethan Burns, Sofia Lemons, Wheeler Ruml, Rong Zhou:
Parallel Best-First Search: The Role of Abstraction. Abstraction, Reformulation, and Approximation 2010 - [c28]Bradford John Larsen, Ethan Burns, Wheeler Ruml, Robert Holte:
Searching Without a Heuristic: Efficient Use of Abstraction. AAAI 2010: 114-120 - [c27]Seth Lemons, J. Benton, Wheeler Ruml, Minh Binh Do, Sung Wook Yoon:
Continual On-line Planning as Decision-Theoretic Incremental Heuristic Search. AAAI Spring Symposium: Embedded Reasoning 2010 - [c26]Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml:
The Joy of Forgetting: Faster Anytime Search via Restarting. ICAPS 2010: 137-144 - [c25]Sung Wook Yoon, Wheeler Ruml, J. Benton, Minh Binh Do:
Improving Determinization in Hindsight for On-line Probabilistic Planning. ICAPS 2010: 209-217 - [c24]David Bond, Niels A. Widger, Wheeler Ruml, Xiaoxun Sun:
Real-Time Search in Dynamic Worlds. SOCS 2010: 16-22 - [c23]Jordan Tyler Thayer, Wheeler Ruml:
Finding Acceptable Solutions Faster Using Inadmissible Information. SOCS 2010: 98-99 - [c22]Jordan Tyler Thayer, Wheeler Ruml:
Anytime Heuristic Search: Frameworks and Algorithms. SOCS 2010: 121-128 - [c21]Christopher Makoto Wilt, Jordan Tyler Thayer, Wheeler Ruml:
A Comparison of Greedy Search Algorithms. SOCS 2010: 129-136 - [c20]Wheeler Ruml:
The Logic of Benchmarking: A Case Against State-of-the-Art Performance. SOCS 2010: 142-143
2000 – 2009
- 2009
- [j5]Razvan C. Bunescu, Vitor R. Carvalho, Jan Chomicki, Vincent Conitzer, Michael T. Cox, Virginia Dignum, Zachary Dodds, Mark Dredze, David Furcy, Evgeniy Gabrilovich, Mehmet H. Göker, Hans W. Guesgen, Haym Hirsh, Dietmar Jannach, Ulrich Junker, Wolfgang Ketter, Alfred Kobsa, Sven Koenig, Tessa A. Lau, Lundy Lewis, Eric T. Matson, Ted Metzler, Rada Mihalcea, Bamshad Mobasher, Joelle Pineau, Pascal Poupart, Anita Raja, Wheeler Ruml, Norman M. Sadeh, Guy Shani, Daniel G. Shapiro, Sarabjot Singh Anand, Matthew E. Taylor, Kiri Wagstaff, Trey Smith, William E. Walsh, Rong Zhou:
AAAI 2008 Workshop Reports. AI Mag. 30(1): 108-118 (2009) - [c19]Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou:
Suboptimal and Anytime Heuristic Search on Multi-Core Machines. ICAPS 2009 - [c18]Jordan Tyler Thayer, Wheeler Ruml:
Using Distance Estimates in Heuristic Search. ICAPS 2009 - [c17]Ethan Burns, Seth Lemons, Rong Zhou, Wheeler Ruml:
Best-First Heuristic Search for Multi-Core Machines. IJCAI 2009: 449-455 - 2008
- [c16]Minh Binh Do, Wheeler Ruml, Rong Zhou:
On-line Planning and Scheduling: An Application to Controlling Modular Printers. AAAI 2008: 1519-1523 - [c15]Minh Binh Do, Wheeler Ruml, Rong Zhou:
Planning for Modular Printers: Beyond Productivity. ICAPS 2008: 68-75 - [c14]Jordan Tyler Thayer, Wheeler Ruml:
Faster than Weighted A*: An Optimistic Approach to Bounded Suboptimal Search. ICAPS 2008: 355-362 - 2007
- [c13]Wheeler Ruml, Minh Binh Do:
Best-First Utility-Guided Search. IJCAI 2007: 2378-2384 - [e1]Ian Miguel, Wheeler Ruml:
Abstraction, Reformulation, and Approximation, 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings. Lecture Notes in Computer Science 4612, Springer 2007, ISBN 978-3-540-73579-3 [contents] - 2006
- [j4]Yi Shang, Wheeler Ruml, Markus P. J. Fromherz:
Positioning using local maps. Ad Hoc Networks 4(2): 240-253 (2006) - [j3]Wolfgang Achtner, Esma Aïmeur, Sarabjot Singh Anand, Douglas E. Appelt, Naveen Ashish, Tiffany Barnes, Joseph E. Beck, M. Bernardine Dias, Prashant Doshi, Chris Drummond, William Elazmeh, Ariel Felner, Dayne Freitag, Hector Geffner, Christopher W. Geib, Richard Goodwin, Robert C. Holte, Frank Hutter, Fair Isaac, Nathalie Japkowicz, Gal A. Kaminka, Sven Koenig, Michail G. Lagoudakis, David B. Leake, Lundy Lewis, Hugo Liu, Ted Metzler, Rada Mihalcea, Bamshad Mobasher, Pascal Poupart, David V. Pynadath, Thomas Roth-Berghofer, Wheeler Ruml, Stefan Schulz, Sven Schwarz, Stephanie Seneff, Amit P. Sheth, Ron Sun, Michael Thielscher, Afzal Upal, Jason D. Williams, Steve J. Young, Dmitry Zelenko:
Reports on the Twenty-First National Conference on Artificial Intelligence (AAAI-06) Workshop Program. AI Mag. 27(4): 92-102 (2006) - [c12]Minh Binh Do, Wheeler Ruml:
Lessons Learned in Applying Domain-Independent Planning to High-Speed Manufacturing. ICAPS 2006: 370-373 - [c11]Haitham A. Hindi, Wheeler Ruml:
Network Flow Modeling for Flexible Manufacturing Systems with Re-entrant Lines. CDC 2006: 1043-1050 - 2005
- [c10]Wheeler Ruml, Minh Binh Do, Markus P. J. Fromherz:
On-line Planning and Scheduling for High-speed Manufacturing. ICAPS 2005: 30-39 - [c9]Wheeler Ruml:
Model-Based Search. SARA 2005: 365-366 - 2004
- [j2]Yi Shang, Wheeler Ruml, Ying Zhang, Markus P. J. Fromherz:
Localization from Connectivity in Sensor Networks. IEEE Trans. Parallel Distributed Syst. 15(11): 961-974 (2004) - [c8]Hai Fang, Wheeler Ruml:
Complete Local Search for Propositional Satisfiability. AAAI 2004: 161-166 - [c7]Yi Shang, Wheeler Ruml:
Improved MDS-Based Localization. INFOCOM 2004: 2640-2651 - 2003
- [c6]Yi Shang, Wheeler Ruml, Ying Zhang, Markus P. J. Fromherz:
Localization from mere connectivity. MobiHoc 2003: 201-212 - 2002
- [c5]Wheeler Ruml:
Principled Exploitation of Heuristic Information. SARA 2002: 345-346 - 2001
- [c4]Wheeler Ruml:
Incomplete Tree Search using Adaptive Probing. IJCAI 2001: 235-241 - [c3]Wheeler Ruml:
Constructing Distributed Representations Using Additive Clustering. NIPS 2001: 107-114
1990 – 1999
- 1999
- [j1]Wheeler Ruml:
Alan W. Biermann, Great Ideas in Computer Science: A Gentle Introduction. Minds Mach. 9(3): 417-421 (1999) - 1997
- [c2]Brad Andalman, Kathy Ryall, Wheeler Ruml, Joe Marks, Stuart M. Shieber:
Design Gallery Browsers Based on 2D and 3D Graph Drawing. GD 1997: 322-329 - [c1]Joe Marks, Brad Andalman, Paul A. Beardsley, William T. Freeman, Sarah F. Gibson, Jessica K. Hodgins, T. Kang, Brian Mirtich, Hanspeter Pfister, Wheeler Ruml, Kathy Ryall, Joshua E. Seims, Stuart M. Shieber:
Design galleries: a general approach to setting parameters for computer graphics and animation. SIGGRAPH 1997: 389-400
Coauthor Index
Ethan Burns
aka: Ethan Andrew Burns
aka: Ethan Andrew Burns
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
