4103 search results - page 179 / 821 » Some results on the Collatz problem |
180
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
154
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
174
click to vote
MCS
2010
Springer
15 years 5 months ago
2010
Springer
Many different constructions for (t, m, s)-nets and (t, s)-sequences are known today. Propagation rules as well as connections to other mathematical objects make it difficult to ...
150
click to vote
SCHEDULING
2010
15 years 5 months ago
2010
This paper considers a shift scheduling problem that includes different forms of flexibility in terms of shift starting times, break lengths and break placement. Two particular ...
180
click to vote
SIAMDM
2010
15 years 5 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...