default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuke Hunsberger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c41]Luke Hunsberger, Roberto Posenato
:
Foundations of Dispatchability for Simple Temporal Networks with Uncertainty. ICAART (2) 2024: 253-263- [c40]Luke Hunsberger, Roberto Posenato:
Converting Simple Temporal Networks with Uncertainty into Minimal Equivalent Dispatchable Form. ICAPS 2024: 290-300 - [c39]Luke Hunsberger, Roberto Posenato:
A Faster Algorithm for Finding Negative Cycles in Simple Temporal Networks with Uncertainty. TIME 2024: 9:1-9:15 - [c38]Luke Hunsberger, Roberto Posenato:
Faster Algorithm for Converting an STNU into Minimal Dispatchable Form. TIME 2024: 11:1-11:14 - [c37]Luke Hunsberger, Roberto Posenato:
Robust Execution of Probabilistic STNs. TIME 2024: 12:1-12:19 - 2023
- [j6]Luke Hunsberger, Roberto Posenato:
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form. Inf. Comput. 293: 105063 (2023) - [c36]Luke Hunsberger, Roberto Posenato:
Converting Simple Temporal Networks with Uncertainty into Dispatchable Form - Faster (Extended Abstract). TIME 2023: 20:1-20:3 - [e2]Alexander Artikis, Florian Bruse, Luke Hunsberger:
30th International Symposium on Temporal Representation and Reasoning, TIME 2023, September 25-26, 2023, NCSR Demokritos, Athens, Greece. LIPIcs 278, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-298-3 [contents] - 2022
- [c35]Luke Hunsberger, Roberto Posenato:
Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty. AAAI 2022: 9776-9785 - 2021
- [c34]Luke Hunsberger, Roberto Posenato:
Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk). TIME 2021: 1:1-1:5 - 2020
- [c33]Luke Hunsberger, Roberto Posenato:
Faster Dynamic-Consistency Checking for Conditional Simple Temporal Networks. ICAPS 2020: 152-160
2010 – 2019
- 2019
- [c32]Luke Hunsberger, Roberto Posenato:
Propagating Piecewise-Linear Weights in Temporal Networks. ICAPS 2019: 223-231 - 2018
- [c31]Luke Hunsberger, Roberto Posenato:
Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks. IJCAI 2018: 1324-1330 - [c30]Massimo Cairo, Luke Hunsberger, Romeo Rizzi:
Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. TIME 2018: 8:1-8:16 - [c29]Luke Hunsberger, Roberto Posenato:
Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty. TIME 2018: 14:1-14:17 - [c28]Luke Hunsberger, Roberto Posenato:
Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking. TIME 2018: 15:1-15:15 - 2017
- [c27]Massimo Cairo, Carlo Combi, Carlo Comin, Luke Hunsberger, Roberto Posenato, Romeo Rizzi, Matteo Zavatteri:
Incorporating Decision Nodes into Conditional Simple Temporal Networks. TIME 2017: 9:1-9:18 - [c26]Massimo Cairo, Luke Hunsberger, Roberto Posenato, Romeo Rizzi:
A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. TIME 2017: 10:1-10:19 - 2016
- [j5]Luke Hunsberger:
Efficient execution of dynamically controllable simple temporal networks with uncertainty. Acta Informatica 53(2): 89-147 (2016) - [j4]Alessandro Cimatti, Luke Hunsberger, Andrea Micheli, Roberto Posenato, Marco Roveri:
Dynamic controllability via Timed Game Automata. Acta Informatica 53(6-8): 681-722 (2016) - [c25]Luke Hunsberger, Roberto Posenato:
Checking the Dynamic Consistency of Conditional Temporal Networks with Bounded Reaction Times. ICAPS 2016: 175-183 - [c24]Luke Hunsberger, Roberto Posenato:
A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks. CP 2016: 268-286 - [e1]Curtis E. Dyreson, Michael R. Hansen, Luke Hunsberger:
23rd International Symposium on Temporal Representation and Reasoning, TIME 2016, Kongens Lyngby, Denmark, October 17-19, 2016. IEEE Computer Society 2016, ISBN 978-1-5090-3825-1 [contents] - 2015
- [c23]Luke Hunsberger, Roberto Posenato, Carlo Combi:
A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks. TIME 2015: 4-18 - 2014
- [c22]Alessandro Cimatti, Luke Hunsberger, Andrea Micheli, Marco Roveri:
Using Timed Game Automata to Synthesize Execution Strategies for Simple Temporal Networks with Uncertainty. AAAI 2014: 2242-2249 - [c21]Luke Hunsberger:
A Faster Algorithm for Checking the Dynamic Controllability of Simple Temporal Networks with Uncertainty. ICAART (1) 2014: 63-73 - [c20]Luke Hunsberger:
New Techniques for Checking Dynamic Controllability of Simple Temporal Networks with Uncertainty. ICAART (Revised Selected Papers) 2014: 170-193 - [c19]Alessandro Cimatti, Luke Hunsberger, Andrea Micheli, Roberto Posenato, Marco Roveri:
Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation. TIME 2014: 27-36 - 2013
- [c18]Carlo Combi, Luke Hunsberger, Roberto Posenato:
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty. ICAART (2) 2013: 144-156 - [c17]Luke Hunsberger:
Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking. ICAART (2) 2013: 157-170 - [c16]Carlo Combi, Luke Hunsberger, Roberto Posenato:
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty - Revisited. ICAART (Revised Selected Papers) 2013: 314-331 - [c15]Luke Hunsberger:
Magic Loops and the Dynamic Controllability of Simple Temporal Networks with Uncertainty. ICAART (Revised Selected Papers) 2013: 332-350 - [c14]Luke Hunsberger:
A Faster Execution Algorithm for Dynamically Controllable STNUs. TIME 2013: 26-33 - 2012
- [i1]Luke Hunsberger, Roberto Posenato, Carlo Combi:
The Dynamic Controllability of Conditional STNs with Uncertainty. CoRR abs/1212.2005 (2012) - 2010
- [c13]Luke Hunsberger:
A Fast Incremental Algorithm for Managing the Execution of Dynamically Controllable Temporal Networks. TIME 2010: 121-128
2000 – 2009
- 2009
- [c12]Anthony Gallagher, Luke Hunsberger, Stephen F. Smith:
Just-in-Time Backfilling in Multi-Agent Scheduling. FLAIRS 2009 - [c11]Luke Hunsberger:
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies. TIME 2009: 155-162 - 2008
- [j3]Luke Hunsberger, Charles L. Ortiz Jr.:
Dynamic intention structures I: a theory of intention representation. Auton. Agents Multi Agent Syst. 16(3): 298-326 (2008) - [c10]Luke Hunsberger:
A Practical Temporal Constraint Management System for Real-Time Applications. ECAI 2008: 553-557 - 2006
- [j2]Barbara J. Grosz, Luke Hunsberger:
The dynamics of intention in collaborative activity. Cogn. Syst. Res. 7(2-3): 259-272 (2006) - [c9]Luke Hunsberger:
Whatever You Say. JELIA 2006: 229-241 - 2005
- [c8]Luke Hunsberger:
A framework for specifying group decision-making mechanisms. AAMAS 2005: 1191-1192 - 2003
- [c7]Luke Hunsberger:
Distributing the control of a temporal network among multiple agents. AAMAS 2003: 899-906 - 2002
- [c6]Luke Hunsberger:
Algorithms for a Temporal Decoupling Problem in Multi-Agent Planning. AAAI/IAAI 2002: 468-475 - 2001
- [c5]Luke Hunsberger:
Generating Bids for Group-Related Actions in the Context of Prior Commitments. ATAL 2001: 248-263 - 2000
- [c4]Luke Hunsberger, Massimo Zancanaro:
A Mechanism for Group Decision Making in Collaborative Activity. AAAI/IAAI 2000: 30-35 - [c3]Luke Hunsberger, Barbara J. Grosz:
A Combinatorial Auction for Collaborative Planning. ICMAS 2000: 151-158
1990 – 1999
- 1999
- [j1]Barbara J. Grosz, Luke Hunsberger, Sarit Kraus:
Planning and Acting Together. AI Mag. 20(4): 23-34 (1999) - 1998
- [c2]Luke Hunsberger:
Making Shared Plans More Concise and Easier to Reason About. ATAL 1998: 81-98 - [c1]Luke Hunsberger:
Making SharedPlans more Concise and Easier to Reason about. ICMAS 1998: 433-434
Coauthor Index
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 2025-03-04 21:12 CET 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:
