A randomized competitive algorithm for evaluating priced AND/OR trees

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Theoretical Computer Science

• Publication date

  2004-03-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.tcs.2008.03.033
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Querying priced information in databases: The conjunctive case

  2004cited by this paper
• Randomized Approximation Algorithms for Query Optimization Problems on Two Processors

  2002cited by this paper
• Processing queries with expensive functions and large objects in distributed mediator systems

  2001cited by this paper
• Query strategies for priced information (extended abstract)

  2000influential reference
• Optimization techniques for queries with expensive methods

  1998cited by this paper
• Online computation and competitive analysis

  1998cited by this paper
• On the Optimality of Randomized alpha-beta Search

  1995cited by this paper
• Randomized algorithms

  1995cited by this paper
• Query Optimization in the Presence of Foreign Functions

  1993cited by this paper
• Probabilistic Boolean decision trees and the complexity of evaluating game trees

  1986influential reference
• Lower Bounds on Probabilistic Linear Decision Trees

  1985influential reference
• Optimal Search on Some Game Trees

  1983cited by this paper
• The solution for the branching factor of the alpha-beta pruning algorithm and its optimality

  1982cited by this paper
• The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm

  1981cited by this paper

• Multivariate Investigation of NP-Hard Problems: Boundaries Between Parameterized Tractability and Intractability

  2020cites this paper
• A Hierarchical Architecture for Human–Robot Cooperation Processes

  2020cites this paper
• And/or-convexity: a graph convexity based on processes and deadlock models

  2017cites this paper
• Complexity and algorithms related to two classes of graph problems

  2017cites this paper
• Tractability, hardness, and kernelization lower bound for and/or graph solution

  2017cites this paper
• Revisiting the complexity of and/or graph solution

  2012cites this paper
• On the competitive ratio of evaluating priced functions

  2011cites this paper
• On the competitive ratio of evaluating priced functions

  2006cites this paper
• Querying priced information in databases: The conjunctive case

  2004cites this paper
• Parameterized Complexity News 3 Parameterized Complexity and Nash Equilibrium

  year unknowncites this paper