Sciweavers

180 search results - page 22 / 36
» Complexity of Homogeneous Co-Boolean Constraint Satisfaction...
Sort
View
AI
2003
Springer
15 years 2 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
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
ICTAI
2002
IEEE
15 years 2 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
63
Voted
ECAI
2006
Springer
15 years 1 months ago
Distributed Log-Based Reconciliation
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...
Yek Loong Chong, Youssef Hamadi
IS
2007
14 years 9 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki