Solomon Eyal Shimony

Affiliations:
  • Ben-Gurion University of the Negev, Beer-Sheva, Israel


According to our database1, Solomon Eyal Shimony authored at least 107 papers between 1986 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Planning and Acting While the Clock Ticks.
CoRR, 2024

2023
On Existence of Must-Include Paths and Cycles in Undirected Graphs.
CoRR, 2023

A Formal Metareasoning Model of Concurrent Planning and Execution.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Situated Grid Pathfinding Among Moving Obstacles (Extended Abstract).
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

When to Commit to an Action in Online Planning and Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Generalized Longest Path Problems.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

2021
Metareasoning for Interleaved Planning and Execution.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Situated Temporal Planning Using Deadline-aware Metareasoning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Trading Plan Cost for Timeliness in Situated Temporal Planning.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Estimating the probability of meeting a deadline in schedules and plans.
Artif. Intell., 2019

Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Improving Bidirectional Heuristic Search by Bounds Propagation.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Algorithm Selection in Optimization and Application to Angry Birds.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Enriching Non-Parametric Bidirectional Search Algorithms.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Allocating Planning Effort When Actions Expire.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Rational deployment of multiple heuristics in optimal state-space search.
Artif. Intell., 2018

2017
Some Properties of Batch Value of Information in the Selection Problem.
J. Artif. Intell. Res., 2017

Optimal ordering of statistically dependent tests.
Discret. Appl. Math., 2017

Monte-Carlo Tree Search using Batch Value of Perfect Information.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Some Properties of Batch Value of Information in the Selection Problem (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2015
Repeated-task Canadian Traveler Problem.
AI Commun., 2015

ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Type System Based Rational Lazy IDA.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Optimal Ordering of Tests with Extreme Dependencies.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

Estimating the Probability of Meeting a Deadline in Hierarchical Plans.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Optimal ordering of independent tests with precedence constraints.
Discret. Appl. Math., 2014

Rational Deployment of Multiple Heuristics in IDA.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

A Quarter of Century in Artificial Intelligence and Law: Projects, Personal Trajectories, a Subjective Perspective.
Proceedings of the Language, Culture, Computation. Computing of the Humanities, 2014

2013
Complexity of Canadian traveler problem variants.
Theor. Comput. Sci., 2013

Towards Rational Deployment of Multiple Heuristics in A*
CoRR, 2013

Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Toward Rational Deployment of Multiple Heuristics in A.
Proceedings of the IJCAI 2013, 2013

2012
Semimyopic Measurement Selection for Optimization Under Uncertainty.
IEEE Trans. Syst. Man Cybern. Part B, 2012

Markov network based ontology matching.
J. Comput. Syst. Sci., 2012

Rational value of information estimation for measurement selection.
Intell. Decis. Technol., 2012

Selecting Computations: Theory and Applications.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

MCTS Based on Simple Rerget.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

VOI-aware MCTS.
Proceedings of the ECAI 2012, 2012

MCTS Based on Simple Regret.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Rational Deployment of CSP Heuristics.
Proceedings of the IJCAI 2011, 2011

2009
Generic Preferences over Subsets of Structured Objects.
J. Artif. Intell. Res., 2009

Semi-Myopic Sensing Plans for Value Optimization
CoRR, 2009

Approximate belief updating in max-2-connected Bayes networks is NP-hard.
Artif. Intell., 2009

Canadian Traveler Problem with Remote Sensing.
Proceedings of the IJCAI 2009, 2009

2008
Prioritizing Point-Based POMDP Solvers.
IEEE Trans. Syst. Man Cybern. Part B, 2008

Observation Subset Selection as Local Compilation of Performance Profiles.
Proceedings of the UAI 2008, 2008

Efficient ADD Operations for Point-Based Algorithms.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2007
Forward Search Value Iteration for POMDPs.
Proceedings of the IJCAI 2007, 2007

Introducing Preferences over NFPs into Service Selection in SOA.
Proceedings of the Service-Oriented Computing, 2007

Scaling Up: Solving POMDPs through Value Based Clustering.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Computing Optimal Subsets.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Discovering Frequent Graph Patterns Using Disjoint Paths.
IEEE Trans. Knowl. Data Eng., 2006

On Graphical Modeling of Preference and Importance.
J. Artif. Intell. Res., 2006

Support measures for graph data.
Data Min. Knowl. Discov., 2006

Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models.
Proceedings of the IEEE International Conference on Systems, 2006

Multi-Agent Handling of Opportunism: AWOL Meets Discretized 'Unreal Tournament'.
Proceedings of the IEEE International Conference on Systems, 2006

Preferences over Sets.
Proceedings of the Proceedings, 2006

2005
Model-Based Online Learning of POMDPs.
Proceedings of the Machine Learning: ECML 2005, 2005

2004
Qualitative decision making in adaptive presentation of structured information.
ACM Trans. Inf. Syst., 2004

Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence.
Int. J. Intell. Syst., 2004

Reasoning with BKBs - Algorithms and Complexity.
Ann. Math. Artif. Intell., 2004

Probabilistic model for schema understanding and matching.
Proceedings of the IEEE International Conference on Systems, 2004

Generalized model for rational game tree search.
Proceedings of the IEEE International Conference on Systems, 2004

Discovery of context-specific Markov blankets.
Proceedings of the IEEE International Conference on Systems, 2004

Adapting existing BKB structures using new data.
Proceedings of the IEEE International Conference on Systems, 2004

2003
Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty.
Int. J. Approx. Reason., 2003

FlexiMine - A Flexible Platform for KDD Research and Application Development.
Ann. Math. Artif. Intell., 2003

Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks.
Artif. Intell., 2003

Abstract world for opportunistic local decisions in multi-agent systems.
Proceedings of the IEEE International Conference on Systems, 2003

Efficient Probabilistic Reasoning in Bayes Nets with Mutual Exclusion and Context Specific Independence.
Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference, 2003

2002
Computing Frequent Graph Patterns from Semistructured Data.
Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002

Semantics and Knowledge Acquisition in Bayesian Knowledge-Bases.
Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference, 2002

2001
Kappa calculus and evidential strength: A note on Åqvist's logical theory of legal evidence.
Artif. Intell. Law, 2001

Bernard Robertson and G. A. [Tony] Vignaux, Interpreting Evidence: Evaluating Forensic Science in the Courtroom.
Artif. Intell. Law, 2001

Preference-Based Configuration of Web Page Content.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
Bayes networks for estimating the number of solutions of constraint networks.
Ann. Math. Artif. Intell., 2000

Independence Semantics for BKBs.
Proceedings of the Thirteenth International Florida Artificial Intelligence Research Society Conference, 2000

1999
Solving Hard Computational Problems through Collections (Portfolios) of Cooperative Heterogeneous Algorithms.
Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference, 1999

1998
Deterministic approximation of marginal probabilities in Bayes nets.
IEEE Trans. Syst. Man Cybern. Part A, 1998

CSPs with counters: a likelihood-based heuristic.
J. Exp. Theor. Artif. Intell., 1998

Structured Plans with Sharing and Replication.
Comput. Artif. Intell., 1998

FlexiMine - A Flexible Platform for KDD Research and Application Construction.
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998

1997
Hybrid algorithms for approximate belief updating in Bayes nets.
Int. J. Approx. Reason., 1997

A Note on Approximate Inclusion-exclusion.
Discret. Appl. Math., 1997

VegeDog: Formalism, Vegetarian Dogs, and Partonomies.
Comput. Artif. Intell., 1997

Cost-Sharing in Bayesian Knowledge Bases.
Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

Bayes Networks for Sonar Sensor Fusion.
Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

Bayes Networks for Estimating the Number of Solutions to a CSP.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997

1996
A Probabilistic Spatial Data Model.
Inf. Sci., 1996

Algorithms for Parsimonious Complete Sets in Directed Graphs.
Inf. Process. Lett., 1996

Exploiting case-based independence for approximating marginal probabilities.
Int. J. Approx. Reason., 1996

Sample-and-Accumulate Algorithms for Belief Updating in Bayes Networks.
Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

1995
The role of relevance in explanation II: Disjunctive assignments and approximate independence.
Int. J. Approx. Reason., 1995

1994
A Probabilistic Object-Oriented Data Model.
Data Knowl. Eng., 1994

Finding MAPs for Belief Networks is NP-Hard.
Artif. Intell., 1994

Cost-Based Abduction and MAP Explanation.
Artif. Intell., 1994

Belief Updating by Enumerating High-Probability Independence-based Assignments.
Proceedings of the UAI '94: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, 1994

1993
The role of relevance in explanation I: Irrelevance as statistical independence.
Int. J. Approx. Reason., 1993

Relevant Explanations: Allowing Disjunctive Assignments.
Proceedings of the UAI '93: Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence, 1993

1992
A Probablistic Framework for Explanation.
PhD thesis, 1992

1991
Algorithms for Irrelevance-Based Partial MAPs.
Proceedings of the UAI '91: Proceedings of the Seventh Annual Conference on Uncertainty in Artificial Intelligence, 1991

Explanation, Irrelevance, and Statistical Independence.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
A new algorithm for finding MAP assignments to belief networks.
Proceedings of the UAI '90: Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence, 1990

Probabilistic Semantics for Cost Based Abduction.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1986
3D scan-conversion algorithms for voxel-based graphics.
Proceedings of the 1986 workshop on Interactive 3D graphics, 1986


  Loading...