4103 search results - page 780 / 821 » Some results on the Collatz problem |
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
ISRR
2005
Springer
14 years 2 months ago
2005
Springer
We postulate that multi-wheel statically-stable mobile robots for operation in human environments are an evolutionarydead end. Robots of this class tall enough to interact meaning...
MLCW
2005
Springer
14 years 2 months ago
2005
Springer
This Chapter presents the PASCAL1 Evaluating Predictive Uncertainty Challenge, introduces the contributed Chapters by the participants who obtained outstanding results, and provide...
OTM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The goal of Model Management is the development of new technologies and mechanisms to support the integration, evolution and matching of models. Such tasks are to be perf...