6274 search results - page 405 / 1255 » From query complexity to computational complexity |
196
click to vote
DBPL
1999
Springer
15 years 11 months ago
1999
Springer
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
201
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
220
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
181
click to vote
COGSCI
2008
15 years 7 months ago
2008
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
190
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Evolutionary Computation is an exciting research field with the power to assist researchers in the task of solving hard optimization problems (i.e., problems where the exploitabl...