Sciweavers

276 search results - page 34 / 56
» New Dynamic SPT Algorithm Based on a Ball-and-String Model
Sort
View
103
Voted
IPPS
2009
IEEE
15 years 4 months ago
Work-first and help-first scheduling policies for async-finish task parallelism
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
Yi Guo, Rajkishore Barik, Raghavan Raman, Vivek Sa...
CONNECTION
2006
172views more  CONNECTION 2006»
14 years 10 months ago
Temporal sequence detection with spiking neurons: towards recognizing robot language instructions
We present an approach for recognition and clustering of spatio temporal patterns based on networks of spiking neurons with active dendrites and dynamic synapses. We introduce a n...
Christo Panchev, Stefan Wermter
92
Voted
PODC
1990
ACM
15 years 2 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 4 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
ICRA
1998
IEEE
141views Robotics» more  ICRA 1998»
15 years 2 months ago
On Discontinuous Human Control Strategies
Models of human control strategy (HCS), which accurately emulate dynamic human behavior, have far reaching potential in areas ranging from robotics to virtual reality to the intel...
Michael C. Nechyba, Yangsheng Xu