8825 search results - page 1270 / 1765 » All for one or one for all |
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
107
click to vote
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
In a publish-subscribe system based on filtering of XML documents, subscribers specify their interests with profiles expressed in the XPath language. The system processes a stre...
IWANN
2001
Springer
15 years 6 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
102
click to vote
STACS
2001
Springer
15 years 6 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
104
click to vote
HPDC
2000
IEEE
15 years 6 months ago
2000
IEEE
While the MPP is still the most common architecture in supercomputer centers today, a simpler and cheaper machine configuration is growing increasingly common. This alternative s...