526 search results - page 55 / 106 » Increments of Random Partitions |
ECSA
2010
Springer
13 years 11 months ago
2010
Springer
In this paper we analyze the effectiveness of dynamic artificial diversity, i.e., artificial diversity in which the subject of the diversity is re-randomized periodically. We refer...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Time...
ISCC
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
ICS
2010
Tsinghua U.
14 years 1 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
SGP
2003
13 years 11 months ago
2003
We propose a scheme for modeling point sample geometry with statistical analysis. In our scheme we depart from the current schemes that deterministically represent the attributes ...