356 search results - page 49 / 72 » Pairwise Cardinality Networks |
133
Voted
PODC
2003
ACM
15 years 7 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
110
click to vote
COMPULOG
1999
Springer
15 years 6 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
109
Voted
TEC
2002
15 years 1 months ago
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
125
click to vote
JCO
2010
15 years 9 days ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
235
Voted
TMA
2012
Springer
13 years 9 months ago
2012
Springer
Large-scale network monitoring systems require efficient storage and consolidation of measurement data. Relational databases and popular tools such as the Round-Robin Database sho...