Sciweavers

405 search results - page 18 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
CEAS
2004
Springer
15 years 1 months ago
Managing Customer Opt-Outs in a Complex Global Environment
The day to day rhetoric associated with spam control focuses on measures, technology, rules or fees to impose order or control. These efforts concentrate on the broad range of mess...
Matt Leonard, Mayra Rodriguez, Richard Segal, Robe...
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
14 years 4 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
LICS
2012
IEEE
12 years 12 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
90
Voted
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
14 years 9 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
SAGA
2001
Springer
15 years 1 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz