4860 search results - page 84 / 972 » SNPs Problems, Complexity, and Algorithms |
151
Voted
CIE
2007
Springer
15 years 10 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
229
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
114
click to vote
LATA
2010
Springer
15 years 10 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
122
click to vote
MST
2008
15 years 3 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
110
click to vote
ICMLA
2004
15 years 5 months ago
2004
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...