1547 search results - page 145 / 310 » Solving Knapsack Problems in a Sticker Based Model |
126
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
135
Voted
AIIA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...
144
Voted
CAEPIA
2003
Springer
15 years 8 months ago
2003
Springer
This paper describes a time-series prediction method based on the kNN technique. The proposed methodology is applied to the 24hour load forecasting problem. Also, based on recorded...
139
click to vote
EOR
2002
15 years 3 months ago
2002
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
124
Voted
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...