4103 search results - page 214 / 821 » Some results on the Collatz problem |
172
click to vote
JCT
2011
15 years 1 months ago
2011
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
175
click to vote
SYNASC
2006
IEEE
16 years 22 days ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
165
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
163
click to vote
CVPR
1996
IEEE
16 years 8 months ago
1996
IEEE
We evaluated six algorithms for computing egomotion from image velocities. We established benchmarks for quantifying bias and sensitivity to noise, and for quantifying the converg...
206
Voted
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...