Sciweavers

4103 search results - page 394 / 821
» Some results on the Collatz problem
Sort
View
PODC
1993
ACM
15 years 11 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
CN
2011
176views more  CN 2011»
14 years 10 months ago
Taming the elephants: New TCP slow start
Standard slow start does not work well under large bandwidthdelay product (BDP) networks. We find two causes of this problem in existing three popular operating systems, Linux, F...
Sangtae Ha, Injong Rhee
ECAL
2005
Springer
16 years 11 days ago
A Self-organising, Self-adaptable Cellular System
Abstract. Inspired by the recent advances in evolutionary biology, we have developed a self-organising, self-adaptable cellular system for multitask learning. The main aim of our p...
Lucien Epiney, Mariusz Nowostawski
CVPR
2010
IEEE
15 years 11 months ago
The Automatic Design of Feature Spaces for Local Image Descriptors using an Ensemble of Non-linear Feature Extractors
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
Gustavo Carneiro
ATAL
2010
Springer
15 years 8 months ago
Infinite order Lorenz dominance for fair multiagent optimization
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
Boris Golden, Patrice Perny