4103 search results - page 67 / 821 » Some results on the Collatz problem |
DAGSTUHL
2004
15 years 1 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
AMC
2005
14 years 11 months ago
2005
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
101
click to vote
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
In this work, we attempt to tackle domain-transfer problem by combining old-domain labeled examples with new-domain unlabeled ones. The basic idea is to use old-domain-trained cla...
ATMOS
2007
15 years 1 months ago
2007
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
ALENEX
2009
15 years 29 days ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...