10146 search results - page 225 / 2030 » Fast FAST |
139
click to vote
PLDI
1996
ACM
15 years 8 months ago
1996
ACM
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
111
click to vote
PODC
1996
ACM
15 years 8 months ago
1996
ACM
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
171
click to vote
KI
1997
Springer
15 years 8 months ago
1997
Springer
One of the fundamental problems in the eld of mobile robotics is the estimation of the robot's position in the environment. Position probability grids have been proven to be a...
139
Voted
ISCAS
1994
IEEE
15 years 8 months ago
1994
IEEE
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
138
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...