2738 search results - page 71 / 548 » The Frobenius Problem and Its Generalizations |
MOC
2002
13 years 9 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
INFORMATICALT
2010
13 years 8 months ago
2010
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
CONEXT
2006
ACM
14 years 4 months ago
2006
ACM
Confronted with the generalization of monitoring in operational networks, researchers have proposed placement algorithms that can help ISPs deploy their monitoring infrastructure ...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
SAC
2011
ACM
13 years 26 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...