16404 search results - page 654 / 3281 » A set coverage problem |
187
click to vote
JDA
2007
15 years 7 months ago
2007
In the admission control problem we are given a network and a set of connection requests, each of which is associated with a path, a time interval, a bandwidth requirement, and a ...
152
click to vote
ENDM
2010
15 years 4 months ago
2010
This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discre...
160
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A problem posed by Freund is how to efficiently track a small pool of experts out of a much larger set. This problem was solved when Bousquet and Warmuth introduced their mixing p...
183
click to vote
CANS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
178
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...