Sciweavers

858 search results - page 129 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
IJCAI
2003
13 years 9 months ago
Temporal Reasoning with Preferences and Uncertainty
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
Neil Yorke-Smith, Kristen Brent Venable, Francesca...
SAC
2009
ACM
14 years 2 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
CPAIOR
2007
Springer
14 years 1 months ago
A Position-Based Propagator for the Open-Shop Problem
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
Jean-Noël Monette, Yves Deville, Pierre Dupon...
CIMCA
2006
IEEE
14 years 1 months ago
A Knowledge-based Security Policy Framework for Business Process Management
Business Process Management (BPM) is often a key component of the business change. Business rules, whether embedded within BPM or on their own, have begun playing an ever-increasi...
Dong Huang, Yi Yang, Jacques Calmet
SAC
2006
ACM
14 years 1 months ago
Post-partition reconciliation protocols for maintaining consistency
This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects repl...
Mikael Asplund, Simin Nadjm-Tehrani