The following pages link to (Q2704802):
Displaying 14 items.
- Concurrent forward bounding for distributed constraint optimization problems (Q359999) (← links)
- On market-inspired approaches to propositional satisfiability (Q814434) (← links)
- A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments (Q814484) (← links)
- Min-domain retroactive ordering for asynchronous backtracking (Q842785) (← links)
- A distributed optimization method for the geographically distributed data centres problem (Q2011585) (← links)
- Group planning with time constraints (Q2248560) (← links)
- Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems (Q2289022) (← links)
- On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
- Explorative anytime local search for distributed constraint optimization (Q2453721) (← links)
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks (Q2457699) (← links)
- Adopt: asynchronous distributed constraint optimization with quality guarantees (Q2457704) (← links)
- Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving (Q2457707) (← links)
- Secure distributed constraint satisfaction: reaching agreement without revealing private information (Q2457708) (← links)
- Distributed personnel scheduling -- negotiation among scheduling agents (Q2468742) (← links)