980 search results - page 106 / 196 » Decentralized Constraint Satisfaction |
CONSTRAINTS
2008
13 years 10 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...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— This paper presents a method to determine whether an assembly of planar parts will stay assembled as it is pushed over a support surface. For a given pushing motion, an assembl...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
BIRTHDAY
2005
Springer
14 years 3 months ago
2005
Springer
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...