Sciweavers

1968 search results - page 147 / 394
» The Complexity of Valued Constraint Models
Sort
View
ICMLA
2008
15 years 5 months ago
Predicting Algorithm Accuracy with a Small Set of Effective Meta-Features
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...
Jun Won Lee, Christophe G. Giraud-Carrier
SAT
2007
Springer
118views Hardware» more  SAT 2007»
15 years 10 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
AAAI
2006
15 years 5 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
DBSEC
2010
152views Database» more  DBSEC 2010»
15 years 5 months ago
Modelling Dynamic Access Control Policies for Web-Based Collaborative Systems
Abstract. We present a modelling language, called X-Policy, for webbased collaborative systems with dynamic access control policies. The access to resources in these systems depend...
Hasan Qunoo, Mark Ryan
IAT
2010
IEEE
15 years 2 months ago
Information Retrieval eXperience (IRX): Towards a Human-Centered Personalized Model of Relevance
We approach Information Retrieval (IR) from a User eXperience (UX) perspective. Through introducing a model for Information Retrieval eXperience (IRX), this paper operationalizes a...
Frans van der Sluis, Egon L. van den Broek, Betsy ...