Sciweavers

2917 search results - page 97 / 584
» Satisfying Interaction Constraints
Sort
View
AAAI
2006
13 years 10 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
SAC
2006
ACM
13 years 8 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 9 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
SCP
2011
228views Communications» more  SCP 2011»
13 years 3 months ago
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
Dave Clarke, José Proença, Alexander...
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 9 months ago
Erratum to "Reformulating table constraints using functional dependencies - an application to explanation generation"
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...
Hadrien Cambazard, Barry O'Sullivan