4103 search results - page 784 / 821 » Some results on the Collatz problem |
STOC
2010
ACM
14 years 24 days ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
ISIPTA
1999
IEEE
14 years 23 days ago
1999
IEEE
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
ASPLOS
1998
ACM
14 years 22 days ago
1998
ACM
Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a reasonable level...
HPDC
1997
IEEE
14 years 21 days ago
1997
IEEE
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by highspeed ne...
ECP
1997
Springer
14 years 19 days ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...