The following pages link to (Q3856120):
Displaying 50 items.
- Formal assessment of reliability specifications in embedded cyber-physical systems (Q334152) (← links)
- A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment (Q339716) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Operations research in the space industry (Q439363) (← links)
- Weighted heuristic anytime search: new schemes for optimization over graphical models (Q513336) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning (Q543630) (← links)
- A deductive solution for plan generation (Q578927) (← links)
- Heuristic search through islands (Q578930) (← links)
- An information roadmap method for robotic sensor path planning (Q614694) (← links)
- Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles (Q686739) (← links)
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
- The problem reduction method under uncertainty and decomposition of functions (Q751321) (← links)
- Parallel state-space search for a first solution with consistent linear speedups (Q757044) (← links)
- A characterization of achievable patterns of the MN-puzzle problem (Q758220) (← links)
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
- A heuristic search algorithm with modifiable estimate (Q792766) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- On randomization and discovery (Q867607) (← links)
- Defining answer classes using resolution refutation (Q881832) (← links)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- On completeness of narrowing strategies (Q912605) (← links)
- On the continuous working problem (Q917431) (← links)
- Multiple stack branch and bound (Q922704) (← links)
- Computing the throughput of concatenation state machines (Q954952) (← links)
- Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602) (← links)
- LR error repair using the A* algorithm (Q969645) (← links)
- Implementing a computer algebra system in Haskell (Q990498) (← links)
- AND/OR search spaces for graphical models (Q1028898) (← links)
- Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
- AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
- Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991) (← links)
- The *-minimax search procedure for trees containing chance nodes (Q1050777) (← links)
- Admissible heuristic search in AND/OR graphs (Q1054163) (← links)
- Human system interface concerns in support system design (Q1055729) (← links)
- Modeling production rules by means of predicate transition networks (Q1058869) (← links)
- Ordering conjunctive queries (Q1060862) (← links)
- Perceptual organization as nested control (Q1062646) (← links)
- Depth-first iterative-deepening: An optimal admissible tree search (Q1062761) (← links)
- Inference procedures under uncertainty for the problem-reduction method (Q1064794) (← links)
- A formal model of diagnostic inference. I. Problem formulation and decomposition (Q1069317) (← links)
- A formal model of diagnostic inference. II. Algorithmic solution and application (Q1069318) (← links)
- PRIAM, an interactive program for chosing among multiple attribute alternatives (Q1071641) (← links)
- Principles of information structure common to six levels of the human cognitive system (Q1072492) (← links)
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
