User:Zarzuelazen/Books/Reality Theory: Complex Systems & Control Theory
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Reality Theory: Complex Systems & Control Theory[edit]
- A* search algorithm
- Action selection
- Active set method
- Adaptive system
- Aitken's delta-squared process
- AIXI
- Alpha shape
- AlphaGo
- AlphaGo versus Lee Sedol
- AlphaGo Zero
- AlphaZero
- Alpha–beta pruning
- Anosov diffeomorphism
- Anticausal system
- Ant colony optimization algorithms
- Any-angle path planning
- Apprenticeship learning
- Approximate max-flow min-cut theorem
- Approximation
- Approximation algorithm
- Approximation error
- Approximation theory
- Arg max
- Arrangement (space partition)
- Arrangement of hyperplanes
- Arrangement of lines
- Artificial intelligence in video games
- Artificial life
- Assignment problem
- Asymptotic expansion
- Attractor
- Auction algorithm
- Augmented Lagrangian method
- Automated planning and scheduling
- Automatic differentiation
- Autonomous system (mathematics)
- Axiom A
- B*
- Backjumping
- Backmarking
- Backtracking
- Backward Euler method
- Barrier function
- Base flow (random dynamical systems)
- Bayesian optimization
- Beam search
- Behavior tree (artificial intelligence, robotics and control)
- Behavior-based robotics
- Belief–desire–intention software model
- Bellman equation
- Bellman–Ford algorithm
- Beltrami identity
- Bernoulli scheme
- Best-first search
- Bidirectional search
- Bifurcation diagram
- Bifurcation theory
- Bin packing problem
- Birth–death process
- Bisection method
- Bistability
- Bitboard
- Board representation (chess)
- Borůvka's algorithm
- Box counting
- Branch and bound
- Breadth-first search
- Brute-force search
- Butterfly effect
- Calculus of variations
- Cantor set
- Catastrophe theory
- Causal loop diagram
- Causal system
- Cellular evolutionary algorithm
- Center manifold
- Chaos game
- Chaos theory
- Chess engine
- Chess opening book (computers)
- Christofides algorithm
- Chromosome (genetic algorithm)
- Circle packing
- Circle packing theorem
- Circulation problem
- Close-packing of equal spheres
- CMA-ES
- Coarse space (numerical analysis)
- Collective intelligence
- Collocation method
- Combinatorial optimization
- Combinatorial search
- Complementarity theory
- Complex adaptive system
- Complex system
- Complexity
- Computable topology
- Computational geometry
- Computational topology
- Computer bridge
- Computer chess
- Computer Go
- Computer poker player
- Computer shogi
- Condition number
- Conflict resolution strategy
- Conic optimization
- Constrained optimization
- Constraint (mathematics)
- Constraint Composite Graph
- Constraint graph
- Constraint learning
- Constraint programming
- Constraint satisfaction
- Constraint satisfaction problem
- Continuous optimization
- Control of chaos
- Convergence (evolutionary computing)
- Convex hull
- Convex optimization
- Coordinate descent
- Correlation dimension
- Costate equation
- Coupled map lattice
- Covering problems
- Critical point (mathematics)
- Cross-entropy method
- Crossover (genetic algorithm)
- Curtis–Hedlund–Lyndon theorem
- Cut (graph theory)
- Cutting stock problem
- Cutting-plane method
- Cybernetical physics
- Cybernetics
- D*
- Deep Blue (chess computer)
- Deep Blue versus Garry Kasparov
- Delaunay triangulation
- Delone set
- Depth-first search
- Derivative test
- Derivative-free optimization
- Deterministic system
- Difference quotient
- Differentiable programming
- Differential evolution
- Dijkstra's algorithm
- Dinic's algorithm
- Discrete calculus
- Discrete geometry
- Discrete optimization
- Discrete space
- Discrete time and continuous time
- Discretization
- Discretization error
- Distributed parameter system
- Domain decomposition methods
- Dual-phase evolution
- Duality (optimization)
- Duality gap
- Duffing equation
- Dynamic programming
- Dynamical system
- Dynamical system (definition)
- Dynamical systems theory
- Edge cover
- Edge of chaos
- Edmonds–Karp algorithm
- Elementary effects method
- End-to-end reinforcement learning
- Endgame tablebase
- Equidistributed sequence
- Equilibrium point
- Ergodic theory
- Ergodicity
- Estimation of distribution algorithm
- Ethical regulator
- Euler method
- Euler–Lagrange equation
- Evaluation function
- Evolution strategy
- Evolutionary algorithm
- Evolutionary computation
- Evolutionary multimodal optimization
- Expectiminimax tree
- Explicit and implicit methods
- Exploration problem
- Exponential integrator
- Facility location problem
- Farkas' lemma
- Feasible region
- Feedback
- Feigenbaum constants
- Fermat's theorem (stationary points)
- Finite difference
- Finite difference method
- Fitness approximation
- Fitness function
- Fitness landscape
- Fitness proportionate selection
- Fixed-point iteration
- Flow (mathematics)
- Flow network
- Flow shop scheduling
- Floyd–Warshall algorithm
- Ford–Fulkerson algorithm
- Fractal
- Fractal analysis
- Fractal canopy
- Fractal dimension
- Fractional programming
- Functional derivative
- Gaussian adaptation
- Gaussian quadrature
- Gauss–Newton algorithm
- Gene expression programming
- General game playing
- General linear methods
- Genetic algorithm
- Genetic algorithm scheduling
- Genetic operator
- Genetic programming
- Genetic representation
- Geometric programming
- Global optimization
- Good regulator
- Gradient descent
- Grammatical evolution
- Graph cut optimization
- Graph traversal
- Greedy algorithm
- Guided Local Search
- Gödel machine
- H tree
- Halley's method
- Hartman–Grobman theorem
- Heteroclinic orbit
- Heuristic (computer science)
- Hierarchical task network
- Hilbert curve
- Hill climbing
- Homoclinic connection
- Homoclinic orbit
- Hopf bifurcation
- Horizon effect
- Horseshoe map
- Householder's method
- Human-based genetic algorithm
- Human–computer chess matches
- Hybrid system
- Hyper-heuristic
- Hyperbolic equilibrium point
- Hyperbolic set
- Hysteresis
- Hénon map
- Incremental heuristic search
- Indefinite sum
- Infinite-dimensional optimization
- Inflection point
- Inheritance (genetic algorithm)
- Instability
- Integer programming
- Interior-point method
- Intermittency
- Interval arithmetic
- Invariant measure
- Iterated function
- Iterated function system
- Iterated local search
- Iterative deepening A*
- Iterative deepening depth-first search
- Iterative method
- Job shop scheduling
- Johnson's algorithm
- Julia set
- Jump point search
- Karush–Kuhn–Tucker conditions
- Kendall's notation
- Killer heuristic
- Kissing number problem
- Knapsack problem
- Koch snowflake
- Kruskal's algorithm
- Krylov–Bogolyubov theorem
- Kuramoto model
- Lacunarity
- Lagrange multiplier
- Lagrange multipliers on Banach spaces
- Lagrangian relaxation
- Laplace's method
- Learning automaton
- Learning classifier system
- Levenberg–Marquardt algorithm
- Limit cycle
- Limit set
- Line search
- Linear approximation
- Linear difference equation
- Linear dynamical system
- Linear matrix inequality
- Linear multistep method
- Linear programming
- Linear stability
- Linear system
- Linear time-invariant system
- Linearization
- Little's law
- Local consistency
- Local optimum
- Local search (constraint satisfaction)
- Local search (optimization)
- Logistic map
- Longest path problem
- Look-ahead (backtracking)
- Lorenz system
- Loss function
- Loss of significance
- Lumped-element model
- Lyapunov exponent
- Lyapunov function
- Lyapunov optimization
- Lyapunov stability
- Lyapunov time
- Makespan
- Mandelbrot set
- Marginal stability
- Markov decision process
- Markov partition
- Master stability function
- Matching (graph theory)
- Mathematical optimization
- Method of matched asymptotic expansions
- Method of steepest descent
- Matrix difference equation
- Max-flow min-cut theorem
- Maxima and minima
- Maximum cut
- Maximum flow problem
- Measure-preserving dynamical system
- Memetic algorithm
- Menger sponge
- Meshfree methods
- Meta-optimization
- Metaheuristic
- Metastability
- Minimax
- Minimum cut
- Minimum spanning tree
- Minimum-cost flow problem
- Minkowski–Bouligand dimension
- Mixing (mathematics)
- Monte Carlo integration
- Monte Carlo localization
- Monte Carlo tree search
- Morse–Smale system
- Motion planning
- Muller's method
- Multi-agent system
- Multi-armed bandit
- Multi-commodity flow problem
- Multi-objective optimization
- Multifractal system
- Multigrid method
- Multiple-scale analysis
- Multiplicative weight update method
- Multistability
- Mutation (genetic algorithm)
- Natural evolution strategy
- Navigation function
- Nearest neighbor search
- Negamax
- Network simplex algorithm
- Neuroevolution
- Newton's method
- Newton's method in optimization
- Newton–Cotes formulas
- NK model
- No free lunch in search and optimization
- Nonlinear programming
- Nonlinear system
- Nonlinear system identification
- Normal form (dynamical systems)
- Numerical analysis
- Numerical differentiation
- Numerical error
- Numerical integration
- Numerical methods for ordinary differential equations
- Numerical partial differential equations
- Numerical stability
- Nyquist stability criterion
- Open-shop scheduling
- Operations research
- Optimal substructure
- Optimization problem
- Orbit (dynamics)
- Ornstein isomorphism theorem
- Overlapping subproblems
- Packing density
- Packing problems
- Parallel metaheuristic
- Parametric programming
- Partial-order planning
- Partially observable Markov decision process
- Particle swarm optimization
- Pathfinding
- Pattern formation
- Peano curve
- Penalty method
- Period-doubling bifurcation
- Periodic point
- Persistent homology
- Perturbation function
- Perturbation theory
- Phase line (mathematics)
- Phase plane
- Phase portrait
- Planar straight-line graph
- Poincaré–Lindstedt method
- Poincaré map
- Poincaré recurrence theorem
- Point location
- Point set triangulation
- Polygon triangulation
- Population-based incremental learning
- Posynomial
- Power diagram
- Preconditioner
- Preference-based planning
- Premature convergence
- Prim's algorithm
- Principal variation search
- Probabilistic roadmap
- Procedural reasoning system
- Product-form solution
- Production system (computer science)
- Projected dynamical system
- Propagation of uncertainty
- Pseudo-Boolean function
- Pseudo-spectral method
- Pullback attractor
- Q-learning
- Quadratic programming
- Quadratic pseudo-Boolean optimization
- Quadrature (mathematics)
- Quantum annealing
- Quantum optimization algorithms
- Quasi-Monte Carlo method
- Quasi-Newton Least Squares Method
- Quasi-Newton method
- Queueing theory
- Quiescence search
- Random dynamical system
- Random search
- Range searching
- Rapidly-exploring random tree
- Rate of convergence
- Reaction–diffusion system
- Reactive planning
- Reasoning system
- Recurrence plot
- Recurrence relation
- Regula falsi
- Reinforcement learning
- Relaxation (approximation)
- Residual (numerical analysis)
- Rete algorithm
- Reward-based selection
- Robot navigation
- Robotic mapping
- Robust optimization
- Robustification
- Root-finding algorithm
- Root locus
- Round-off error
- Routh–Hurwitz stability criterion
- Runge–Kutta methods
- Rössler attractor
- Saddle point
- Saddle-node bifurcation
- Scenario optimization
- Search algorithm
- Secant method
- Second partial derivative test
- Second-order cone programming
- Selection (genetic algorithm)
- Self-assembly
- Self-organization
- Self-organized criticality
- Self-oscillation
- Self-replication
- Self-similarity
- Semidefinite programming
- Sensitivity analysis
- Sequential minimal optimization
- Series acceleration
- Set cover problem
- Set packing
- Shape optimization
- Sharkovskii's theorem
- Shift space
- Shift-invariant system
- Shortest path problem
- Sierpinski carpet
- Sierpiński triangle
- Significance arithmetic
- Signomial
- Simplex algorithm
- Simulated annealing
- Simulation-based optimization
- Simultaneous localization and mapping
- Singular perturbation
- Slack variable
- Slow manifold
- Space-filling curve
- Spectral method
- Sphere packing
- Spontaneous order
- Spreading activation
- Stability criterion
- Stability radius
- Stability theory
- Stable manifold
- State space
- State space planning
- State space search
- State variable
- State–action–reward–state–action
- Stationary point
- Steady state
- Steffensen's method
- Stiff equation
- Stochastic approximation
- Stochastic calculus
- Stochastic cellular automaton
- Stochastic differential equation
- Stochastic diffusion search
- Stochastic dynamic programming
- Stochastic gradient descent
- Stochastic optimization
- Stochastic partial differential equation
- Stochastic programming
- Stochastic universal sampling
- Stockfish (chess)
- Strong duality
- Structural stability
- Subgradient method
- Submodular set function
- Subshift of finite type
- Subsumption architecture
- Sum-of-squares optimization
- Supermodular function
- Swarm intelligence
- Symbolic dynamics
- Synchronization
- Synchronization of chaos
- System
- System dynamics
- System identification
- Systems science
- Systems theory
- Tabu search
- Takens's theorem
- Temporal difference learning
- Test functions for optimization
- Thompson sampling
- Time evolution
- Time reversibility
- Time-scale calculus
- Time-invariant system
- Time-variant system
- Topological conjugacy
- Topology optimization
- Tournament selection
- Trajectory optimization
- Transportation theory (mathematics)
- Transposition table
- Transshipment problem
- Travelling salesman problem
- Tree traversal
- Triangulation (geometry)
- Truncation error
- Truncation error (numerical integration)
- Trust region
- Turing pattern
- Uncertainty quantification
- Van der Pol oscillator
- Variance-based sensitivity analysis
- Variation (game tree)
- Variational inequality
- Variety (cybernetics)
- Vector optimization
- Vehicle routing problem
- Vertex cover
- Visibility graph
- Von Neumann universal constructor
- Voronoi diagram
- Wandering set
- Weak duality
- Weighted Voronoi diagram
- Winner-take-all in action selection
- Wolfe conditions
- Zobrist hashing