Sciweavers

198 search results - page 30 / 40
» Colouring, constraint satisfaction, and complexity
Sort
View
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
15 years 9 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
IJCAI
2001
14 years 11 months ago
Making AC-3 an Optimal Algorithm
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
Yuanlin Zhang, Roland H. C. Yap
AAAI
2006
14 years 11 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
RE
2010
Springer
14 years 4 months ago
Fuzzy Goals for Requirements-Driven Adaptation
Self-adaptation is imposing as a key characteristic of many modern software systems to tackle their complexity and cope with the many environments in which they can operate. Self-a...
Luciano Baresi, Liliana Pasquale, Paola Spoletini
ICTL
1994
15 years 1 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto