3946 search results - page 620 / 790 » The computational complexity of choice sets |
151
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
185
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
253
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
191
click to vote
ICDT
2010
ACM
16 years 4 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
207
click to vote
AGS
2009
Springer
16 years 1 months ago
2009
Springer
We propose a novel approach to intelligent tutoring gaming simulations designed for both educational and inquiry purposes in complex multi-actor systems such as infrastructures or...