Sciweavers

559 search results - page 48 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
FLAIRS
2004
13 years 9 months ago
A New Algorithm for Singleton Arc Consistency
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...
Roman Barták, Radek Erben
ECAI
2006
Springer
13 years 11 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
EAAI
2008
111views more  EAAI 2008»
13 years 7 months ago
Fuzzy conditional temporal problems: Strong and weak consistency
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
Marco Falda, Francesca Rossi, Kristen Brent Venabl...
FLAIRS
2008
13 years 10 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
14 years 7 months ago
Leveraging aggregate constraints for deduplication
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
Surajit Chaudhuri, Anish Das Sarma, Venkatesh Gant...