559 search results - page 48 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
130
click to vote
FLAIRS
2004
15 years 4 months ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...
107
Voted
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
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...
148
Voted
EAAI
2008
15 years 3 months ago
2008
: 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...
140
click to vote
FLAIRS
2008
15 years 5 months ago
2008
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...
187
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
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...