Sciweavers

211 search results - page 18 / 43
» Optimality Theory and the Generative Complexity of Constrain...
Sort
View
CGO
2007
IEEE
14 years 2 months ago
Loop Optimization using Hierarchical Compilation and Kernel Decomposition
The increasing complexity of hardware features for recent processors makes high performance code generation very challenging. In particular, several optimization targets have to b...
Denis Barthou, Sébastien Donadio, Patrick C...
PASTE
2004
ACM
14 years 1 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
UAI
1997
13 years 9 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
ICRA
2009
IEEE
121views Robotics» more  ICRA 2009»
14 years 2 months ago
Real-time trajectory generation for car-like vehicles navigating dynamic environments
— This paper presents Tiji, a trajectory generation scheme, ie an algorithm that computes a feasible trajectory between a start and a goal state, for a given robotic system. Tiji...
Vivien Delsart, Thierry Fraichard, Luis Martinez
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
12 years 11 months ago
Partial pole placement with minimum norm controller
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
Subashish Datta, Balarko Chaudhuri, Debraj Chakrab...