2560 search results - page 25 / 512 » Contributions to zero-sum problems |
150
Voted
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
100
Voted
ISICA
2007
Springer
15 years 9 months ago
2007
Springer
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
128
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
127
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
116
Voted
EOR
2008
15 years 3 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...