2738 search results - page 257 / 548 » The Frobenius Problem and Its Generalizations |
181
click to vote
WLP
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Meta-S is a constraint solver cooperation system which allows the dynamic integration of arbitrary external (stand-alone) solvers and their combination with declarative l...
182
click to vote
DATESO
2007
15 years 8 months ago
2007
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
147
click to vote
AAAI
2006
15 years 8 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
212
click to vote
JMLR
2008
15 years 6 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
185
click to vote
INFORMS
1998
15 years 6 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...