default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandra Zilles
- > Home > Persons > Sandra Zilles
Publications
- 2022
[c79]Elham Parhizkar, Mohammad Hossein Nikravan, Robert C. Holte, Sandra Zilles:
Using Change Detection to Adapt to Dynamically Changing Trustees. Canadian AI 2022- [c78]Robert C. Holte, S. Mahmoud Mousawi, Sandra Zilles:
Distinguishing Relational Pattern Languages With a Small Number of Short Strings. ALT 2022: 498-514 - 2020
- [c72]Elham Parhizkar, Mohammad Hossein Nikravan, Robert C. Holte, Sandra Zilles:
Combining Direct Trust and Indirect Trust in Multi-Agent Systems. IJCAI 2020: 311-317 - 2019
- [c70]Robert C. Holte, Sandra Zilles:
On the Optimal Efficiency of Cost-Algebraic A. AAAI 2019: 2288-2295 - 2017
- [c65]Jürgen Eckerle, Jingwei Chen, Nathan R. Sturtevant, Sandra Zilles, Robert C. Holte:
Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search. ICAPS 2017: 79-87 - [c62]Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions. IJCAI 2017: 489-495 - [i4]Jingwei Chen, Robert C. Holte, Sandra Zilles, Nathan R. Sturtevant:
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions. CoRR abs/1703.03868 (2017) - [i3]Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics. CoRR abs/1711.05105 (2017) - 2016
- [j26]Levi H. S. Lelis, Roni Stern
, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner, Robert C. Holte:
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces. Artif. Intell. 230: 51-73 (2016) - [c57]Levi H. S. Lelis, Santiago Franco, Marvin Abisrror, Mike Barley, Sandra Zilles, Robert C. Holte:
Heuristic Subset Selection in Classical Planning. IJCAI 2016: 3185-3191 - 2014
- [j22]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost. Ann. Math. Artif. Intell. 72(3-4): 267-295 (2014) - [c51]Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
A Comparison of h 2 and MMM for Mutex Pair Detection Applied to Pattern Databases. Canadian AI 2014: 227-238 - 2013
- [j18]Levi H. S. Lelis, Sandra Zilles, Robert C. Holte:
Predicting the size of IDA*'s search tree. Artif. Intell. 196: 53-76 (2013) - [c43]Levi H. S. Lelis, Sandra Zilles, Robert C. Holte:
Stratified tree search: a novel suboptimal heuristic search algorithm. AAMAS 2013: 555-562 - [c42]Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
Detecting Mutex Pairs in State Spaces by Sampling. Australasian Conference on Artificial Intelligence 2013: 490-501 - [c40]Mehdi Sadeqi, Robert C. Holte, Sandra Zilles:
Using Coarse State Space Abstractions to Detect Mutex Pairs. SARA 2013 - 2012
- [c39]Levi Lelis, Sandra Zilles, Robert C. Holte:
Fast and Accurate Predictions of IDA*'s Performance. AAAI 2012: 514-520 - [c38]Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling. ICAPS 2012 - [c36]Shahin Jabbari, Robert C. Holte, Sandra Zilles:
PAC-Learning with General Class Noise Models. KI 2012: 73-84 - [c35]Xiaomin Zhang, Sandra Zilles, Robert C. Holte:
Improved Query Suggestion by Query Search. KI 2012: 205-216 - [c33]Levi H. S. Lelis, Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Learning Heuristic Functions Faster by Using Predicted Solution Costs. SOCS 2012: 166-167 - [c32]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract). SOCS 2012: 186-187 - 2011
- [j16]Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Learning heuristic functions for large state spaces. Artif. Intell. 175(16-17): 2075-2098 (2011) - [j15]Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich:
Models of Cooperative Teaching and Learning. J. Mach. Learn. Res. 12: 349-384 (2011) - [c31]Levi Lelis, Sandra Zilles, Robert C. Holte:
Time Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract). AAAI 2011: 1800-1801 - [c24]Levi Lelis, Sandra Zilles, Robert C. Holte:
Improved Prediction of IDA*'s Performance via Epsilon-Truncation. SOCS 2011: 108-116 - 2010
- [j13]Sandra Zilles, Robert C. Holte:
The computational complexity of avoiding spurious states in state space abstraction. Artif. Intell. 174(14): 1072-1092 (2010) - [c20]Shahab Jabbari Arfaee, Sandra Zilles, Robert C. Holte:
Bootstrap Learning of Heuristic Functions. SOCS 2010: 52-60 - 2009
- [c18]Sandra Zilles, Robert C. Holte:
Downward Path Preserving State Space Abstractions (Extended Abstract). SARA 2009 - [c17]Shen Jiang, Sandra Zilles, Robert C. Holte:
Query Suggestion by Query Search: A New Approach to User Support in Web Search. Web Intelligence 2009: 679-684 - 2008
- [c13]Sandra Zilles, Steffen Lange, Robert Holte, Martin Zinkevich:
Teaching Dimensions based on Cooperative Learning. COLT 2008: 135-146 - [c12]Shen Jiang, Sandra Zilles, Robert Holte:
Empirical Analysis of the Rank Distribution of Relevant Documents in Web Search. Web Intelligence 2008: 208-213
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-09-13 01:41 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:
