2233 search results - page 167 / 447 » On the Complexity of Theory Curbing |
150
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
157
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
159
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
165
click to vote
PODS
2010
ACM
15 years 6 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
140
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....