Sciweavers

3148 search results - page 419 / 630
» On the Dynamic Initialization of Parallel Computers
Sort
View
IJCAI
2007
15 years 3 months ago
Improving Anytime Point-Based Value Iteration Using Principled Point Selections
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
15 years 2 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
15 years 6 months ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...
IEEEPACT
2000
IEEE
15 years 6 months ago
The Effect of Code Reordering on Branch Prediction
Branch prediction accuracy is a very important factor for superscalarprocessor performance. The ability topredict the outcome of a branch allows the processor to effectively use a...
Alex Ramírez, Josep-Lluis Larriba-Pey, Mate...
IPPS
1999
IEEE
15 years 6 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...