Sciweavers

1368 search results - page 148 / 274
» Generalized Rook Polynomials
Sort
View
CP
2008
Springer
15 years 6 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
ECAI
2008
Springer
15 years 6 months ago
SLIDE: A Useful Special Case of the CARDPATH Constraint
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the sli...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
AAAI
2010
15 years 6 months ago
Fixing a Tournament
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
Virginia Vassilevska Williams
154
Voted
AAAI
2010
15 years 6 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
CCCG
2010
15 years 6 months ago
On polygons excluding point sets
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
Radoslav Fulek, Balázs Keszegh, Filip Moric...