Sciweavers

12453 search results - page 75 / 2491
» Concurrent Data Structures
Sort
View
AROBOTS
1998
104views more  AROBOTS 1998»
15 years 1 months ago
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic...
Sebastian Thrun, Wolfram Burgard, Dieter Fox
IPPS
2006
IEEE
15 years 7 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
ICFP
2010
ACM
15 years 2 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
JPDC
2007
84views more  JPDC 2007»
15 years 1 months ago
Performance of memory reclamation for lockless synchronization
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
TVLSI
2008
140views more  TVLSI 2008»
15 years 1 months ago
A Novel Mutation-Based Validation Paradigm for High-Level Hardware Descriptions
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...
Jorge Campos, Hussain Al-Asaad