Sciweavers

884 search results - page 88 / 177
» Control structures in programs and computational complexity
Sort
View
PEPM
2004
ACM
14 years 1 months ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal
HPDC
2002
IEEE
14 years 22 days ago
Interactive and Descriptor-Based Deployment of Object-Oriented Grid Applications
Increasing complexity of distributed applications and commodity of resources through grids are making the tasks of deploying those applications harder. There is a clear need for s...
Françoise Baude, Denis Caromel, Fabrice Hue...
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
13 years 6 months ago
Fast resolution of hierarchized inverse kinematics with inequality constraints
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
Adrien Escande, Nicolas Mansard, Pierre-Brice Wieb...
CDES
2008
90views Hardware» more  CDES 2008»
13 years 9 months ago
Nanocompilation for the Cell Matrix Architecture
- The Cell Matrix Architecture is a massive array of dynamically self-configurable, uniformly connected, identical computational units. This architecture can enable efficient, prac...
Thomas Way, Rushikesh Katikar, Ch. Purushotham
DAGSTUHL
2001
13 years 9 months ago
Decision-Theoretic Control of Planetary Rovers
Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such res...
Shlomo Zilberstein, Richard Washington, Daniel S. ...