This paper addresses the problem of loading a finite capacity, stochastic (random) and dynamic multi-project system. The system is controlled by keeping a constant number of projec...
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
— We derive new bounds on the aperiodic total squared correlation (ATSC) of binary antipodal signature sets for any number of signatures K and any signature length L. We then pre...
Harish Ganapathy, Dimitrios A. Pados, George N. Ka...
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...