Sciweavers

1381 search results - page 27 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
AAAI
1994
13 years 11 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
13 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 2 days 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
CSR
2009
Springer
13 years 10 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
ICSOC
2003
Springer
14 years 2 months ago
E-healthcare via Customized Information Services: Addressing the Need for Factually Consistent Information
Abstract. Web portals provide an efficient gateway to a broad range of Eservices, resources and information. Web portals need to evolve towards being adaptive in nature, so that th...
Syed Sibte Raza Abidi, Yong Han Chong