Keyphrases
#P-hard
11%
Admissible Heuristics
22%
Algorithm Analysis
11%
Approximation Accuracy
11%
Approximation Algorithms
14%
Approximation Bound
30%
Characteristic Function
22%
Classical Planning
7%
Coalitional Game
22%
Complexity Results
11%
Computational Complexity
22%
Description Logics
7%
Discrete Variables
25%
Error Bound
11%
Exact Computation
33%
Execution Time
22%
Expected Makespan
18%
Game Design
7%
Greedy Best First Search
22%
Heuristic Function
22%
Hierarchical Planning
45%
Kolmogorov
22%
Kolmogorov Distance
17%
Main Application
11%
Makespan
11%
Mechanism Design
7%
Memory Algorithm
11%
Memory Complexity
33%
Motivation
11%
Node number
11%
Novel Mechanism
7%
NP-hard
52%
Number of Events
11%
Numerical Computation
11%
Optimal Approximation
45%
Planning Algorithms
11%
Planning Domain
7%
Polynomial Complexity
11%
Polynomial-time Algorithm
11%
Private Information
15%
Private Type
22%
Project Deadline
25%
Random Variables
67%
Sampling Methods
11%
Stochastic Characteristics
22%
Sums of Independent Random Variables
11%
Support Size
9%
Task Network
11%
Time Complexity
22%
Uncertain Task Times
18%
Computer Science
Approximation (Algorithm)
52%
Approximation Algorithms
15%
Characteristic Function
22%
Completing Task
22%
Complexity Result
7%
Computational Complexity
7%
Description Logics
22%
Execution Time
22%
Heuristic Function
22%
Heuristic Value
22%
Hierarchical Plan
37%
Intermediate Store
7%
Mechanism Design
11%
Numerical Computation
7%
Planning Algorithm
7%
Polynomial Time
22%
Primitive Task
7%
Random Variable
37%
Sampling Technique
7%
Time Complexity
7%
Mathematics
Algorithm Analysis
7%
Discrete Random Variable
25%
Error Bound
11%
Kolmogorov Distance
13%
Numerical Computation
5%
Polynomial Time
28%
Probability Theory
100%
Random Variable
75%
Rounding
5%
Sampling Technique
11%
Summation
8%
