16666 search results - page 3061 / 3334 » Descriptive and Computational Complexity |
244
Voted
ALGORITHMICA
2011
15 years 1 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
230
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Computational analysis of metagenomes requires the taxonomical assignment of the genome contigs assembled from DNA reads of environmental samples. Because of the diver...
209
click to vote
COMCOM
2011
15 years 1 months ago
2011
In the very active field of complex networks, research advances have largely been stimulated by the availability of empirical data and the increase in computational power needed ...
205
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing informa...
214
click to vote
CSL
2011
Springer
15 years 1 months ago
2011
Springer
We describe the design and evaluation of two different dynamic student uncertainty adaptations in wizarded versions of a spoken dialogue tutoring system. The two adaptive systems...