808 search results - page 20 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
88
Voted
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
91
Voted
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
FLAIRS
2008
14 years 12 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
JCP
2008
14 years 9 months ago
2008
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
105
click to vote
CONSTRAINTS
2008
14 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...