4103 search results - page 49 / 821 » Some results on the Collatz problem |
175
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
143
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Sh...
166
click to vote
CSC
2008
15 years 7 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
134
click to vote
INFORMS
2008
15 years 6 months ago
2008
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
156
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...