100 search results - page 12 / 20 » A distance-labelling problem for hypercubes |
ECIR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional "resourc...
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
The investigation of evolutionary algorithms as adaptation schemes has a long history starting with Holland (1975). The Ising model from physics leads to a variety of different pr...
SOFSEM
1997
Springer
15 years 3 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
JSA
2000
14 years 11 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we consider the problem of discovering frequent temporal patterns in a database of temporal sequences, where a temporal sequence is a set of items with associated da...