Pages that link to "Item:Q2457704"

The following pages link to Adopt: asynchronous distributed constraint optimization with quality guarantees (Q2457704):

Displaying 34 items.

• Concurrent forward bounding for distributed constraint optimization problems (Q359999) (← links)
• Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies (Q377733) (← links)
• An overview of parallel SAT solving (Q487635) (← links)
• Bounded approximate decentralised coordination via the max-sum algorithm (Q543622) (← links)
• Probabilistic optimal solution assessment for DCOPs (Q722106) (← links)
• AND/OR search spaces for graphical models (Q1028898) (← links)
• AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
• A cooperative optimization algorithm inspired by chaos-order transition (Q1667142) (← links)
• Forward bounding on pseudo-trees for DCOPs and ADCOPs (Q1677435) (← links)
• Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (Q1706596) (← links)
• Incentive-based search for equilibria in Boolean games (Q2009196) (← links)
• A distributed optimization method for the geographically distributed data centres problem (Q2011585) (← links)
• A dual-population search differential evolution algorithm for functional distributed constraint optimization problems (Q2095552) (← links)
• A framework for parallel and distributed training of neural networks (Q2181060) (← links)
• Privacy stochastic games in distributed constraint reasoning (Q2202511) (← links)
• PC-SyncBB: a privacy preserving collusion secure DCOP algorithm (Q2238607) (← links)
• Group planning with time constraints (Q2248560) (← links)
• Governing convergence of Max-sum on DCOPs through damping and splitting (Q2287205) (← links)
• Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems (Q2289022) (← links)
• Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs (Q2321250) (← links)
• Adding laziness in BnB-ADOPT\(^+\) (Q2342651) (← links)
• Explorative anytime local search for distributed constraint optimization (Q2453721) (← links)
• On the computational complexity of coalitional resource games (Q2457612) (← links)
• Real-time supply chain control via multi-agent adjustable autonomy (Q2483492) (← links)
• An efficient distributed optimization and coordination protocol: application to the emergency vehicle management (Q2514639) (← links)
• Solving distributed constraint optimization problems using logic programming (Q4593098) (← links)
• SOLVING CONSTRAINED OPTIMIZATION PROBLEMS USING PROBABILITY COLLECTIVES AND A PENALTY FUNCTION APPROACH (Q4650013) (← links)
• Proactive Dynamic Distributed Constraint Optimization Problems (Q5094012) (← links)
• IDB-ADOPT: A Depth-First Search DCOP Algorithm (Q5191411) (← links)
• Soft Agents: Exploring Soft Constraints to Model Robust Adaptive Distributed Cyber-Physical Agent Systems (Q5256354) (← links)
• Communication-Aware Local Search for Distributed Constraint Optimization (Q5870489) (← links)
• Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver (Q5881805) (← links)
• Privacy preserving solution of DCOPs by mediation (Q6161505) (← links)
• Counterexamples and amendments to the termination and optimality of ADOPT-based algorithms (Q6494376) (← links)