4377 search results - page 271 / 876 » Mass problems and randomness |
164
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
205
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
159
click to vote
CSE
2008
IEEE
15 years 6 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
134
click to vote
EOR
2000
15 years 6 months ago
2000
This paper addresses the problem of scheduling randomly arriving tasks of dierent types at a diversi
210
click to vote
PKC
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and ...