Sciweavers

250 search results - page 30 / 50
» The complexity of temporal constraint satisfaction problems
Sort
View
ECAI
2006
Springer
14 years 8 days 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
13 years 8 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
CP
2008
Springer
13 years 10 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
CSMR
1998
IEEE
14 years 26 days ago
Assessing Architectural Complexity
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
Rick Kazman, M. Burth
ATAL
2010
Springer
13 years 9 months ago
Optimal temporal decoupling in multiagent systems
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
Léon Planken, Mathijs de Weerdt, Cees Witte...