1705 search results - page 101 / 341 » Representing Constraints with Automata |
COCO
2007
Springer
14 years 4 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
CPAIOR
2007
Springer
14 years 4 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
FSTTCS
2007
Springer
14 years 4 months ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
ECAI
2004
Springer
14 years 3 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
CDC
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...